Go to the documentation of this file.
50 #ifndef vtkIncrementalOctreePointLocator_h
51 #define vtkIncrementalOctreePointLocator_h
170 (
double radius,
const double x[3],
double & dist2 );
181 (
double radius2,
const double x[3],
double & dist2 );
299 int BuildCubicOctree;
300 int MaxPointsPerLeaf;
301 double InsertTolerance2;
302 double OctreeMaxDimSize;
322 const double pnt[3] );
333 const double point[3],
double * dist2 );
350 double * minDist2,
const double * refDist2 );
368 vtkIdType FindClosestPointInSphereWithoutTolerance(
const double point[3],
396 vtkIdType FindClosestPointInSphereWithTolerance(
const double point[3],
421 vtkIdType IsInsertedPointForZeroTolerance
434 vtkIdType IsInsertedPointForNonZeroTolerance
445 const double point[3] );
455 vtkIdType FindDuplicateFloatTypePointInVisitedLeafNode
466 vtkIdType FindDuplicateDoubleTypePointInVisitedLeafNode
represent and manipulate 3D points
void FindPointsWithinSquaredRadius(double R2, const double x[3], vtkIdList *result)
#define vtkGetObjectMacro(name, type)
virtual vtkIdType IsInsertedPoint(double x, double y, double z)=0
virtual vtkIdType FindClosestPoint(double x, double y, double z)
virtual void GenerateRepresentation(int nodeLevel, vtkPolyData *polysData)
virtual void GetBounds(double *bounds)
virtual int InitPointInsertion(vtkPoints *points, const double bounds[6])
static vtkIncrementalOctreePointLocator * New()
void PrintSelf(ostream &os, vtkIndent indent)
void InsertPointWithoutChecking(const double point[3], vtkIdType &pntId, int insert)
virtual ~vtkIncrementalOctreePointLocator()
virtual double * GetBounds()
virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result)
virtual void FreeSearchStructure()=0
virtual vtkIdType IsInsertedPoint(const double x[3])
#define vtkTypeMacro(thisClass, superclass)
GLint GLint GLint GLint GLint x
virtual double * GetBounds()
GLsizei const GLfloat * points
vtkIncrementalOctreePointLocator()
virtual void BuildLocator()
vtkIdType FindClosestPointWithinSquaredRadius(double radius2, const double x[3], double &dist2)
virtual int InsertUniquePoint(const double point[3], vtkIdType &pntId)
#define vtkSetClampMacro(name, type, min, max)
virtual vtkIdType IsInsertedPoint(double x, double y, double z)
virtual void InsertPoint(vtkIdType ptId, const double x[3])
virtual int InitPointInsertion(vtkPoints *points, const double bounds[6], vtkIdType estSize)
Incremental octree in support of both point location and point insertion.
a simple class to control print indentation
object to represent cell connectivity
virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)
Abstract class in support of both point location and point insertion.
list of point or cell ids
virtual void Initialize()
Octree node constituting incremental octree (in support of both point location and point insertion)
#define vtkGetMacro(name, type)
virtual void FreeSearchStructure()
virtual vtkIdType FindClosestPoint(const double x[3])
vtkBooleanMacro(IgnoreDriverBugs, bool)
vtkSetMacro(IgnoreDriverBugs, bool)
virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)
virtual vtkIdType FindClosestPoint(double x, double y, double z, double *miniDist2)
GLint GLint GLint GLint GLint GLint y
concrete dataset represents vertices, lines, polygons, and triangle strips
virtual vtkIdType FindClosestInsertedPoint(const double x[3])
#define VTKCOMMONDATAMODEL_EXPORT
virtual vtkIdType InsertNextPoint(const double x[3])
virtual vtkIdType FindClosestPoint(const double x[3], double *miniDist2)