[vtkusers] Kdtree, m neighbors

[Dominik Szczerba]

I asked the same question a while ago and got no answer. I guess that is 
not possible out of the box (you may want to use CGAL for that)
  - Dominik

heike hufnagel wrote:
> Hello,
> 
> I work with vtkPoints objects, and I would like to
> find the m closest point to a given point in the data
> set. Is there any way I can use Kdtrees for that task?
> Because in the class decription I only found functions
> giving back the one closest point to a given point,
> not a list of the m closest points.
> 
> Thanks a lot in advance
> Heike
> 
> 
> 
> 
> 
>       __________________________________  Yahoo! Clever: Sie haben Fragen? Yahoo! Nutzer antworten Ihnen. www.yahoo.de/clever
> 
> _______________________________________________
> This is the private VTK discussion list. 
> Please keep messages on-topic. Check the FAQ at: http://www.vtk.org/Wiki/VTK_FAQ
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers

-- 
Dominik Szczerba, PhD
Computer Vision Lab CH-8092 Zurich
http://www.vision.ee.ethz.ch/~domi