CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Bo Schwarzstein wrote:
> Try STANN or just ANN is faster than CGAL's solution.
Sorry to re-open this old thread but I just run a benchmark, and
on tested examples I found that CGAL Orthogonal_nearest_neighbor is
faster than STANN and ANN.

Do you have examples where you found that this is not true?

S.


> 2010/4/2 Anthony Palomba < 
> <mailto:>>
>
>     Awesome thanks!
>
>
>     -ap
>
>
>
>
>
>     On Thu, Apr 1, 2010 at 11:00 AM, Andreas Fabri
>     
> <
>     
> <mailto:>>
>  wrote:
>
>
>         The best way to start is going into the package overview
>
>         http://www.cgal.org/Manual/last/doc_html/cgal_manual/packages.html
>
>         click on Spatial Searching and Sorting
>         which brings you here:
>
>         
> http://www.cgal.org/Manual/last/doc_html/cgal_manual/packages.html#part_XIII
>
>         and click on "User Manual" of the Chapter   "dD Spatial Searching"
>
>         There are examples which you also find in the distribution
>
>         andreas
>
>
>
>
>         On 01/04/2010 17:48, Anthony Palomba wrote:
>
>             I am interested in using CGAL to explore finding the
>             approximate nearest
>             neighbor
>             of a point with in a system of points.
>
>             What interface should I start looking at?
>
>
>
>             Thanks,
>             Anthony
>
>
>
>         -- 
>         You are currently subscribed to cgal-discuss.
>         To unsubscribe or access the archives, go to
>         https://lists-sop.inria.fr/wws/info/cgal-discuss