Hi CGAL discuss!

I have a task on hand: Given a set of axis-aligned 2D rectangles and a query

axis-aligned 2D rectangle, efficiently (better than O(n)) find the subset

of rectangles that intersect the query rectangle.

Is there some data structure in CGAL that can help with this? I looked over

the documentation and it seems that most of the search/indexing structures

work with point sets and not more general shapes.

I heard there is R-tree that can do this kind of polygon indexing for fast

intersection queries. Does CGAL have something like that or equivalent? Or

is some other approach available?

Thanks guys!!

Duane

--

Sent from:

http://cgal-discuss.949826.n4.nabble.com/--

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://sympa.inria.fr/sympa/info/cgal-discuss