[vtkusers] Kdtree, m neighbors

[heike hufnagel]

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

[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

Post by heike hufnagel
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
http://www.vtk.org/mailman/listinfo/vtkusers

[Dominik Szczerba]

-------- Original Message --------
Subject: Re: [vtkusers] Kdtree, m neighbors
Date: Fri, 25 May 2007 09:59:36 +0200
From: ***@l5.pk.edu.pl (Roman Putanowicz)
To: Dominik Szczerba <***@vision.ee.ethz.ch>
References: <***@web23202.mail.ird.yahoo.com>
<***@vision.ee.ethz.ch>

Another solution would be to use ANN (Approximate Nearest Neighbour) library
http://www.cs.umd.edu/~mount/ANN/
but of course one heve to translate vtk data into ANN structure (which
should
not be to difficult). Deffinitely it is simpler than using CGAL.

Regards

Roman

Post by 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

Post by heike hufnagel
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.
http://www.vtk.org/Wiki/VTK_FAQ
http://www.vtk.org/mailman/listinfo/vtkusers

--
Dominik Szczerba, PhD
Computer Vision Lab CH-8092 Zurich
http://www.vision.ee.ethz.ch/~domi
_______________________________________________
This is the private VTK discussion list.
http://www.vtk.org/Wiki/VTK_FAQ
http://www.vtk.org/mailman/listinfo/vtkusers

--
Roman Putanowicz < ***@l5.pk.edu.pl >
Institute for Computational Civil Engng (L-5)
Dept. of Civil Engng, Cracow Univ. of Technology
www.l5.pk.edu.pl, tel. [phone], fax 2034

[Luca Pallozzi Lavorante]

Hi Heike,I think vtkPointLocatorŽs FindPointsWithinRadius() method does what
you are looking for.
It doesnŽt return a predefined number of points but all the points (pointsŽ
Ids, actually), within a given radius.
Hope this helps

Luca