CGAL users discussion list

["Grzegorz Hermanowicz" <>]

Thanks, 
This looks pretty interesting. I'm half trough the paper. Yet I'm still interested with CGAL. 
In my simulations I can't make assumption about even placement of the individuals in the space. They may bunch up in one place or spread around depending on the dynamically chosen search radius/behavior.  Thus I wanted to avoid a static size grid solutions.  Delaunay semed to be good structure for the task because if I can iterate over all vertexes in the set any crowding is no different than even spread. And if I'm not wrong the biggest cost for the single iteration would be O(nlogn) to rebuild the triangulation as the range queries with limited result size should cost me O(n). From other things I wanted to include into simulation are  map like structures: borders, barriers etc but thats a bonus for now.   

Cheers
       Grzegorz Hermanowicz

2008/11/5 Wesley Smith <>

Not to suggest that CGAL couldn't do what you are asking, but if all
you need is some kind of spatial query system, there's a highly
efficient "query sphere indexing" package available here:
http://nicolas.brodu.numerimoire.net/en/programmation/neighand/index.html

See this paper for more info:
http://nicolas.brodu.free.fr/common/recherche/publications/QuerySphereIndexing.pdf

wes
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss