CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 10/01/2012 04:55 PM, Артур Юнусо wrote:
> The last function argument doesn't allow to change *the way* how points
In your setting, k is large since and you don't want to copy and sort 
the points, right?

The current API does not allow to sort in-place the points.
If you want to hack CGAL to give it a try, make the variable "queue"
of class K_neighbor_search public in file internal/K_neighbor_search.h.
Then in file internal/bounded_priority_queue.h, add a sort method
taking a comparator as argument.

Sebastien.

> are sorted.
> 01.10.2012 18:30, Sebastien Loriot (GeometryFactory) пишет:
> > On 09/20/2012 10:53 AM, aptypr wrote:
> > > In the example for k neighbor searching I found that
> > > CGAL::Orthogonal_k_neighbor_search return points, sorted by distance of
> > > initial point, are there ways to sort point in process of searching?
> > > I want
> > > to sort points by x, and if x are the same, by y. Right now I search k
> > > neighbors, and sort them, which is expensive.
> > >
> > >
> > >
> > > --
> > > View this message in context:
> > > http://cgal-discuss.949826.n4.nabble.com/dD-Spatial-Searching-sort-points-tp4655879.html
> > >
> > > Sent from the cgal-discuss mailing list archive at Nabble.com.
> > As documented in [1], the last function argument control whether the
> > sequence of points need to be sorted.
> >
> > Sebastien.
> >
> > [1]
> > http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Spatial_searching_ref/Class_Orthogonal_k_neighbor_search.html