Question

i would like to build a dynamic data structure that can hold a list of polygons and return a list of polygons that overlaps a specified rectangle.

i looked into bst trees (and quad trees) but these dont seem to work too well when the polygons overlap heavily.

any good ideas i should check out before i roll my own nonsense?

edit

lets assume all the polygons are normal non rotated rectangles. im willing to take the hit (point in polygon test) during point tests (i might be doing it anyway), and during a region test getting their bounding boxes is just as good. only a small percentage of them will actually not overlap the region in question.

Answer 1

i just wrote a regular quadtree, that allowed each leaf node to hold unlimited polys, if the intersection of the bounds of the leaf and the bounds of each poly in the bucket were equivalent. otherwise leaf nodes are limited to 8 polys, before splitting.