41 #ifndef __vtkPointLocator_h
42 #define __vtkPointLocator_h
44 #include "vtkIncrementalPointLocator.h"
48 class vtkNeighborPoints;
59 void PrintSelf(ostream& os,
vtkIndent indent);
63 vtkSetVector3Macro(Divisions,
int);
64 vtkGetVectorMacro(Divisions,
int,3);
70 vtkGetMacro(NumberOfPointsPerBucket,
int);
77 virtual vtkIdType FindClosestPoint(
const double x[3]);
84 virtual vtkIdType FindClosestPointWithinRadius(
85 double radius,
const double x[3],
double& dist2);
86 virtual vtkIdType FindClosestPointWithinRadius(
double radius,
const double x[3],
87 double inputDataLength,
double& dist2);
94 virtual int InitPointInsertion(
vtkPoints *newPts,
const double bounds[6]);
101 virtual int InitPointInsertion(
vtkPoints *newPts,
const double bounds[6],
112 virtual void InsertPoint(
vtkIdType ptId,
const double x[3]);
121 virtual vtkIdType InsertNextPoint(
const double x[3]);
130 xyz[0] = x; xyz[1] = y; xyz[2] = z;
131 return this->IsInsertedPoint (xyz);
133 virtual vtkIdType IsInsertedPoint(
const double x[3]);
143 virtual int InsertUniquePoint(
const double x[3],
vtkIdType &ptId);
150 virtual vtkIdType FindClosestInsertedPoint(
const double x[3]);
158 virtual void FindClosestNPoints(
int N,
const double x[3],
vtkIdList *result);
166 virtual void FindDistributedPoints(
int N,
const double x[3],
168 virtual void FindDistributedPoints(
int N,
double x,
double y,
177 virtual void FindPointsWithinRadius(
double R,
const double x[3],
185 virtual vtkIdList *GetPointsInBucket(
const double x[3],
int ijk[3]);
196 void FreeSearchStructure();
198 void GenerateRepresentation(
int level,
vtkPolyData *pd);
206 void GetBucketNeighbors(vtkNeighborPoints* buckets,
207 const int ijk[3],
const int ndivs[3],
int level);
208 void GetOverlappingBuckets(vtkNeighborPoints* buckets,
209 const double x[3],
const int ijk[3],
double dist,
211 void GetOverlappingBuckets(vtkNeighborPoints* buckets,
212 const double x[3],
double dist,
214 int prevMaxLevel[3]);
215 void GenerateFace(
int face,
int i,
int j,
int k,
217 double Distance2ToBucket(
const double x[3],
const int nei[3]);
218 double Distance2ToBounds(
const double x[3],
const double bounds[6]);
int NumberOfPointsPerBucket
quickly locate points in 3-space
vtkIdType InsertionPointId
vtkIdType IsInsertedPoint(double x, double y, double z)
vtkIdType NumberOfBuckets
concrete dataset represents vertices, lines, polygons, and triangle strips
a simple class to control print indentation
list of point or cell ids
object to represent cell connectivity
#define VTK_LARGE_INTEGER
represent and manipulate 3D points