Hi,<br><br>For n-dimensional computation, I would use ITK rather than VTK. The highly <br>templated architecture gives you more freedom regarding the type of data and elements.<br><br>HTH<br>Jerome<br><br><div class="gmail_quote">
2011/6/8 agerlach <span dir="ltr"><<a href="mailto:agerlach@gmail.com">agerlach@gmail.com</a>></span><br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
All,<br>
<br>
I would like to be able to use a Kd (or something similar) to be able to<br>
search for closest point in a 6D space. Is there anyway to do this using<br>
VTK? From the documentation, it looks like the vtkKdTree class operates on<br>
vtkPoints which are only 3D.<br>
<br>
If the answer is no, then is there any reasonable way to extend vtkPoints or<br>
vtkKdTree to be more general and operate in n-D spaces?<br>
<br>
Thanks!<br>
<br>
<br>
<br>
--<br>
View this message in context: <a href="http://vtk.1045678.n5.nabble.com/Can-a-kD-Tree-be-built-for-data-with-3-Dimensions-tp4471049p4471049.html" target="_blank">http://vtk.1045678.n5.nabble.com/Can-a-kD-Tree-be-built-for-data-with-3-Dimensions-tp4471049p4471049.html</a><br>
Sent from the VTK - Users mailing list archive at Nabble.com.<br>
_______________________________________________<br>
Powered by <a href="http://www.kitware.com" target="_blank">www.kitware.com</a><br>
<br>
Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
<br>
Please keep messages on-topic and check the VTK FAQ at: <a href="http://www.vtk.org/Wiki/VTK_FAQ" target="_blank">http://www.vtk.org/Wiki/VTK_FAQ</a><br>
<br>
Follow this link to subscribe/unsubscribe:<br>
<a href="http://www.vtk.org/mailman/listinfo/vtkusers" target="_blank">http://www.vtk.org/mailman/listinfo/vtkusers</a><br>
</blockquote></div><br>