Go to the documentation of this file.
51 #ifndef vtkIncrementalOctreePointLocator_h
52 #define vtkIncrementalOctreePointLocator_h
54 #include "vtkCommonDataModelModule.h"
83 vtkSetClampMacro( MaxPointsPerLeaf,
int, 16, 256 );
84 vtkGetMacro( MaxPointsPerLeaf,
int );
101 vtkGetObjectMacro( LocatorPoints,
vtkPoints );
117 void GetBounds(
double * bounds )
override;
128 int GetNumberOfPoints();
195 (
double radius,
const double x[3],
double & dist2 )
override;
205 vtkIdType FindClosestPointWithinSquaredRadius
206 (
double radius2,
const double x[3],
double & dist2 );
215 (
double R,
const double x[3],
vtkIdList * result )
override;
223 void FindPointsWithinSquaredRadius
224 (
double R2,
const double x[3],
vtkIdList * result );
233 (
int N,
const double x[3],
vtkIdList * result )
override;
316 void InsertPointWithoutChecking
327 int MaxPointsPerLeaf;
328 double InsertTolerance2;
329 double OctreeMaxDimSize;
351 const double pnt[3] );
361 const double point[3],
double * dist2 );
377 double * minDist2,
const double * refDist2 );
394 vtkIdType FindClosestPointInSphereWithoutTolerance(
const double point[3],
420 vtkIdType FindClosestPointInSphereWithTolerance(
const double point[3],
443 vtkIdType IsInsertedPointForZeroTolerance
455 vtkIdType IsInsertedPointForNonZeroTolerance
466 const double point[3] );
475 vtkIdType FindDuplicateFloatTypePointInVisitedLeafNode
485 vtkIdType FindDuplicateDoubleTypePointInVisitedLeafNode
represent and manipulate 3D points
virtual int InsertUniquePoint(const double x[3], vtkIdType &ptId)=0
Insert a point unless there has been a duplciate in the search structure.
virtual vtkIdType IsInsertedPoint(double x, double y, double z)=0
Determine whether or not a given point has been inserted.
double * GetBounds() override
Get the spatial bounding box of the octree.
virtual void InsertPoint(vtkIdType ptId, const double x[3])=0
Insert a given point with a specified point index ptId.
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.
virtual vtkIdType InsertNextPoint(const double x[3])=0
Insert a given point and return the point index.
Incremental octree in support of both point location and point insertion.
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
virtual vtkIdType FindClosestInsertedPoint(const double x[3])=0
Given a point x assumed to be covered by the search structure, return the index of the closest point ...
Abstract class in support of both point location and point insertion.
list of point or cell ids
virtual void BuildLocator()=0
Build the locator from the input dataset.
Octree node constituting incremental octree (in support of both point location and point insertion)
virtual int InitPointInsertion(vtkPoints *newPts, const double bounds[6])=0
Initialize the point insertion process.
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)=0
Find the closest N points to a position.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
concrete dataset represents vertices, lines, polygons, and triangle strips
virtual vtkIdType FindClosestPoint(const double x[3])=0
Given a position x, return the id of the point closest to it.
void Initialize() override
Delete the octree search structure.
virtual void FreeSearchStructure()=0
Free the memory required for the spatial data structure.
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.