[Insight-users] Finding the closest pixel with a specific criteria

[Seth Gilchrist]

Hi David,
You might consider using the vtk function
vtk::vtkKdTreePointLocator::FindClosestPointWithinRadius(double radius,
const double x[3], double &dist2)

It will return the points in a given radius and also the distance to each
point.  I don't know if it is faster or slower (probably slower), but your
current function might return a point that is farther from the seed location
than another just because it was earlier in the iteration list.

You would have to use itk::VTKImageExport to bring your image over to vtk
which will also add time.

Cheers,
Seth
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.itk.org/pipermail/insight-users/attachments/20110901/586e4b80/attachment.htm>