[Insight-users] itk::kdtree and itk::hashtable

[Luis Ibanez]

Hi Motes,

You may find useful the class

            itkPointLocator2

in the NAMIC Sandbox:

  NAMICSandBox/QuadEdgeMeshRigidRegistration/Source

http://svn.na-mic.org/NAMICSandBox/trunk/QuadEdgeMeshRigidRegistration/Source/


It uses internally a KdTree in order to perform the type
of point search that you are describing.


    Regards,

           Luis


-----------------------------------------
On Fri, Nov 20, 2009 at 5:59 AM, motes motes <mort.motes at gmail.com> wrote:
> Assume that I  have 100 points in 3D which I have used to build a
> kdTree.  For a given point P I can use the KdTree to find the
> k-nearest neighbors.
>
> But since each point acutally corresponds to the location of a unique
> object that contains additional that data I need, I would like to get
> these objects based on their location returned from the kd-tree.
>
> I would therefore like to store each object in a itk::hashtable based
> on its 3D location. When I get the set of neighbors from the kd-tree I
> can use each location as a key to retreive the object.
>
> I know how to use the itk::kdtree, but have not been able to find any
> examples using the itk::hashtable. Does anyone know if the above idea
> would work with the itk::hashtable or know of any examples  using the
> itk::hashtable?
> _____________________________________
> Powered by www.kitware.com
>
> Visit other Kitware open-source projects at
> http://www.kitware.com/opensource/opensource.html
>
> Kitware offers ITK Training Courses, for more information visit:
> http://www.kitware.com/products/protraining.html
>
> Please keep messages on-topic and check the ITK FAQ at:
> http://www.itk.org/Wiki/ITK_FAQ
>
> Follow this link to subscribe/unsubscribe:
> http://www.itk.org/mailman/listinfo/insight-users
>