Go to the documentation of this file.
37 #ifndef vtkOctreePointLocator_h
38 #define vtkOctreePointLocator_h
40 #include "vtkCommonDataModelModule.h"
61 vtkSetMacro(MaximumPointsPerRegion,
int);
62 vtkGetMacro(MaximumPointsPerRegion,
int);
69 vtkSetMacro(CreateCubicOctants,
int);
70 vtkGetMacro(CreateCubicOctants,
int);
80 vtkGetMacro(FudgeFactor,
double);
81 vtkSetMacro(FudgeFactor,
double);
97 vtkGetMacro(NumberOfLeafNodes,
int);
103 void GetRegionBounds(
int regionID,
double bounds[6]);
108 void GetRegionDataBounds(
int leafNodeID,
double bounds[6]);
113 int GetRegionContainingPoint(
double x,
double y,
double z);
137 double radius,
const double x[3],
double& dist2)
override;
145 vtkIdType FindClosestPointInRegion(
int regionId,
double *x,
double &dist2);
146 vtkIdType FindClosestPointInRegion(
int regionId,
double x,
double y,
147 double z,
double &dist2);
190 void FindPointsInArea(
double* area,
vtkIdTypeArray* ids,
bool clearArray =
true);
242 int _FindClosestPointInRegion(
int leafNodeId,
double x,
double y,
243 double z,
double &dist2);
252 int FindClosestPointInSphere(
double x,
double y,
double z,
double radius,
253 int skipRegion,
double &dist2);
represent and manipulate 3D points
an octree spatial decomposition of a set of points
virtual double * GetBounds()
Provide an accessor to the bounds.
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
int NumberOfLocatorPoints
Octree node that has 8 children each of equal size.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
vtkOctreePointLocatorNode ** LeafNodeList
vtkOctreePointLocatorNode * Top
int CreateCubicOctants
If CreateCubicOctants is non-zero, the bounding box of the points will be expanded such that all octa...
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
Method to build a representation at a particular level.
virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)=0
Find all points within a specified radius R of position x.
a simple class to control print indentation
object to represent cell connectivity
list of point or cell ids
virtual void BuildLocator()=0
Build the locator from the input dataset.
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)=0
Find the closest N points to a position.
dynamic, self-adjusting array of vtkIdType
concrete dataset represents vertices, lines, polygons, and triangle strips
abstract class to quickly locate points in 3-space
virtual vtkIdType FindClosestPoint(const double x[3])=0
Given a position x, return the id of the point closest to it.
virtual void FreeSearchStructure()=0
Free the memory required for the spatial data structure.
int MaximumPointsPerRegion
The maximum number of points in a region/octant before it is subdivided.
virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)=0
Given a position x and a radius r, return the id of the point closest to the point in that radius.