CGAL users discussion list

[Roger House <>]

I have an application in which I need to find the pairwise intersection 
of hundreds, sometimes thousands, of polygons.  The obvious approach is 
quadratic in the number of polygons, and I am hoping there are much more 
efficient ways to do it.  Any information on algorithms for fast 
pairwise intersection of polygons will be greatly appreciated.

Roger House