Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master
Fetching contributors…

Cannot retrieve contributors at this time

91 lines (70 sloc) 3.243 kb
/*=========================================================================
Program: Visualization Toolkit
Module: vtkKdTreePointLocator.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
// .NAME vtkKdTreePointLocator - class to quickly locate points in 3-space
// .SECTION Description
// vtkKdTreePointLocator is a wrapper class that derives from
// vtkAbstractPointLocator and calls the search functions in vtkKdTree.
// .SECTION See Also
// vtkKdTree
#ifndef __vtkKdTreePointLocator_h
#define __vtkKdTreePointLocator_h
#include "vtkAbstractPointLocator.h"
class vtkIdList;
class vtkKdTree;
class VTK_FILTERING_EXPORT vtkKdTreePointLocator : public vtkAbstractPointLocator
{
public:
vtkTypeMacro(vtkKdTreePointLocator,vtkAbstractPointLocator);
static vtkKdTreePointLocator* New();
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// Given a position x, return the id of the point closest to it. Alternative
// method requires separate x-y-z values.
// These methods are thread safe if BuildLocator() is directly or
// indirectly called from a single thread first.
virtual vtkIdType FindClosestPoint(const double x[3]);
// Description:
// Given a position x and a radius r, return the id of the point
// closest to the point in that radius.
// dist2 returns the squared distance to the point.
virtual vtkIdType FindClosestPointWithinRadius(
double radius, const double x[3], double& dist2);
// Description:
// Find the closest N points to a position. This returns the closest
// N points to a position. A faster method could be created that returned
// N close points to a position, but necessarily the exact N closest.
// The returned points are sorted from closest to farthest.
// These methods are thread safe if BuildLocator() is directly or
// indirectly called from a single thread first.
virtual void FindClosestNPoints(
int N, const double x[3], vtkIdList *result);
// Description:
// Find all points within a specified radius R of position x.
// The result is not sorted in any specific manner.
// These methods are thread safe if BuildLocator() is directly or
// indirectly called from a single thread first.
virtual void FindPointsWithinRadius(double R, const double x[3],
vtkIdList *result);
// Description:
// See vtkLocator interface documentation.
// These methods are not thread safe.
virtual void FreeSearchStructure();
virtual void BuildLocator();
virtual void GenerateRepresentation(int level, vtkPolyData *pd);
protected:
vtkKdTreePointLocator();
virtual ~vtkKdTreePointLocator();
vtkKdTree* KdTree;
private:
vtkKdTreePointLocator(const vtkKdTreePointLocator&); // Not implemented.
void operator=(const vtkKdTreePointLocator&); // Not implemented.
};
#endif
Jump to Line
Something went wrong with that request. Please try again.