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

[Jérôme]

Hi,

For n-dimensional computation, I would use ITK rather than VTK. The highly
templated architecture gives you more freedom regarding the type of data and
elements.

HTH
Jerome

2011/6/8 agerlach <agerlach at gmail.com>

> 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.
> _______________________________________________
> Powered by www.kitware.com
>
> Visit other Kitware open-source projects at
> http://www.kitware.com/opensource/opensource.html
>
> Please keep messages on-topic and check the VTK FAQ at:
> http://www.vtk.org/Wiki/VTK_FAQ
>
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20110609/3de9f7b5/attachment.htm>