25 #ifndef vtkOctreePointLocator_h
26 #define vtkOctreePointLocator_h
29 #include "vtkCommonDataModelModule.h"
31 VTK_ABI_NAMESPACE_BEGIN
50 vtkSetMacro(MaximumPointsPerRegion,
int);
51 vtkGetMacro(MaximumPointsPerRegion,
int);
58 vtkSetMacro(CreateCubicOctants,
int);
59 vtkGetMacro(CreateCubicOctants,
int);
69 vtkGetMacro(FudgeFactor,
double);
70 vtkSetMacro(FudgeFactor,
double);
86 vtkGetMacro(NumberOfLeafNodes,
int);
92 void GetRegionBounds(
int regionID,
double bounds[6]);
97 void GetRegionDataBounds(
int leafNodeID,
double bounds[6]);
102 int GetRegionContainingPoint(
double x,
double y,
double z);
140 vtkIdType FindClosestPointInRegion(
int regionId,
double* x,
double& dist2);
141 vtkIdType FindClosestPointInRegion(
int regionId,
double x,
double y,
double z,
double& dist2);
182 void FindPointsInArea(
double* area,
vtkIdTypeArray* ids,
bool clearArray =
true);
235 int FindClosestPointInRegion_(
int leafNodeId,
double x,
double y,
double z,
double& dist2);
244 int FindClosestPointInSphere(
245 double x,
double y,
double z,
double radius,
int skipRegion,
double& dist2);
274 VTK_ABI_NAMESPACE_END
virtual void BuildLocator()=0
Build the locator from the input dataset.
an octree spatial decomposition of a set of points
int NumberOfLocatorPoints
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...
int CreateCubicOctants
If CreateCubicOctants is non-zero, the bounding box of the points will be expanded such that all octa...
virtual double * GetBounds()
Provide an accessor to the bounds.
int MaximumPointsPerRegion
The maximum number of points in a region/octant before it is subdivided.
dynamic, self-adjusting array of vtkIdType
concrete dataset represents vertices, lines, polygons, and triangle strips
virtual void FreeSearchStructure()=0
Free the memory required for the spatial data structure.
int NumberOfLeafNodes
The maximum number of points in a region/octant before it is subdivided.
vtkOctreePointLocatorNode ** LeafNodeList
a simple class to control print indentation
virtual void BuildLocatorInternal()
This function is not pure virtual to maintain backwards compatibility.
void PrintSelf(ostream &os, vtkIndent indent) override
Standard type and print methods.
abstract class to quickly locate points in 3-space
list of point or cell ids
virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)=0
Find all points within a specified radius R of position x.
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)=0
Find the closest N points to a position.
object to represent cell connectivity
Octree node that has 8 children each of equal size.
vtkOctreePointLocatorNode * Top
virtual vtkIdType FindClosestPoint(const double x[3])=0
Given a position x, return the id of the point closest to it.
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on...
virtual void GenerateRepresentation(int level, vtkPolyData *pd)=0
Method to build a representation at a particular level.
represent and manipulate 3D points
virtual void ForceBuildLocator()
Build the locator from the input dataset (even if UseExistingSearchStructure is on).