[Insight-developers] best bin first adaptation of Kdtree?

[Luis Ibanez]

Hi Richard,

Are you looking for class to


   a) given a set of points "S" and an external point "P"


   b) find the point is "S" that is closest to "P"  ?


If so, you will find such class in the following directory of the NAMIC
Sandbox:

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


The class is called itkPointLocator2, and should become a replacement
for the (currently not functional) itk::PointLocator in the directory
Insight/Code/Common.

This class uses the KdTree internally...


    Regards,


        Luis



-------------------------
Richard Beare wrote:
> Has anyone implemented Lowe's best bin first algorithm for fast,
> approximate nearest neighbour search in ITK? It looks like it should
> be a relatively simple extension, but I'm still finding my way around
> the KD tree.
> _______________________________________________
> Insight-developers mailing list
> Insight-developers at itk.org
> http://www.itk.org/mailman/listinfo/insight-developers
>