[vtkusers] Can a kD-Tree be built for data with > 3 Dimensions

[agerlach]

All,

I would like to be able to use a Kd (or something similar) to be able to
search for closest point in a 6D space. Is there anyway to do this using
VTK? From the documentation, it looks like the vtkKdTree class operates on
vtkPoints which are only 3D. 

If the answer is no, then is there any reasonable way to extend vtkPoints or
vtkKdTree to be more general and operate in n-D spaces?

Thanks!



--
View this message in context: http://vtk.1045678.n5.nabble.com/Can-a-kD-Tree-be-built-for-data-with-3-Dimensions-tp4471049p4471049.html
Sent from the VTK - Users mailing list archive at Nabble.com.