CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

If you look at the implementation of the function in AABB_tree.h,
 you'll see that this operation is done thanks to a traversal traits
"Projection_traits".
If you look at the implementation of this traits in the file 
internal/AABB_tree/AABB_traversal_traits.h you can create
a new traversal traits class that can do what you want.


Sebastien.


On 05/16/2012 11:31 AM, libicocco wrote:
> Hello,
>
> I'm a newbie in CGAL. I'm wondering if it's possible to obtain a number of
> nearest points and primitives (instead of one as in
> closest_point_and_primitive). Since, according to the documentation, the
> closest point is found by a ball search, I assumed it would be easy to
> convert this function into a k-nearest neighbor or to a radius search. The
> purpose is to reject the closest points with a normal which is incoherent to
> the query normal.
>
> Has anybody done that? What is the simplest/fastest way of doing it?
>
> Thanks
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/KNN-or-ball-search-in-AABB-tree-tp4641090.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.