VTK  9.2.6
vtkOctreePointLocator.h
Go to the documentation of this file.
1/*=========================================================================
2
3 Program: Visualization Toolkit
4 Module: vtkOctreePointLocator.h
5
6 Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7 All rights reserved.
8 See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9
10 This software is distributed WITHOUT ANY WARRANTY; without even
11 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12 PURPOSE. See the above copyright notice for more information.
13
14=========================================================================*/
15/*----------------------------------------------------------------------------
16 Copyright (c) Sandia Corporation
17 See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
18----------------------------------------------------------------------------*/
19
49#ifndef vtkOctreePointLocator_h
50#define vtkOctreePointLocator_h
51
53#include "vtkCommonDataModelModule.h" // For export macro
54
55class vtkCellArray;
56class vtkIdTypeArray;
58class vtkPoints;
59class vtkPolyData;
60
61class VTKCOMMONDATAMODEL_EXPORT vtkOctreePointLocator : public vtkAbstractPointLocator
62{
63public:
65 void PrintSelf(ostream& os, vtkIndent indent) override;
66
68
70
73 vtkSetMacro(MaximumPointsPerRegion, int);
74 vtkGetMacro(MaximumPointsPerRegion, int);
76
78
81 vtkSetMacro(CreateCubicOctants, int);
82 vtkGetMacro(CreateCubicOctants, int);
84
86
92 vtkGetMacro(FudgeFactor, double);
93 vtkSetMacro(FudgeFactor, double);
95
97
101 double* GetBounds() override;
102 void GetBounds(double* bounds) override;
104
106
109 vtkGetMacro(NumberOfLeafNodes, int);
111
115 void GetRegionBounds(int regionID, double bounds[6]);
116
120 void GetRegionDataBounds(int leafNodeID, double bounds[6]);
121
125 int GetRegionContainingPoint(double x, double y, double z);
126
134 void BuildLocator() override;
135
139 void ForceBuildLocator() override;
140
142
146 vtkIdType FindClosestPoint(const double x[3]) override;
147 vtkIdType FindClosestPoint(double x, double y, double z, double& dist2);
149
155 vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double& dist2) override;
156
158
163 vtkIdType FindClosestPointInRegion(int regionId, double* x, double& dist2);
164 vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, double& dist2);
166
171 void FindPointsWithinRadius(double radius, const double x[3], vtkIdList* result) override;
172
181 void FindClosestNPoints(int N, const double x[3], vtkIdList* result) override;
182
187
191 void FreeSearchStructure() override;
192
197 void GenerateRepresentation(int level, vtkPolyData* pd) override;
198
205 void FindPointsInArea(double* area, vtkIdTypeArray* ids, bool clearArray = true);
206
207protected:
210
211 void BuildLocatorInternal() override;
212
214 vtkOctreePointLocatorNode** LeafNodeList; // indexed by region/node ID
215
217
219
223 int FindRegion(vtkOctreePointLocatorNode* node, float x, float y, float z);
224 int FindRegion(vtkOctreePointLocatorNode* node, double x, double y, double z);
226
228
230
237 vtkOctreePointLocatorNode* node, double radiusSquared, const double x[3], vtkIdList* ids);
238
239 // Recursive helper for public FindPointsWithinRadius
241
242 // Recursive helper for public FindPointsInArea
244
245 // Recursive helper for public FindPointsInArea
247
248 void DivideRegion(vtkOctreePointLocatorNode* node, int* ordering, int level);
249
250 int DivideTest(int size, int level);
251
253
258 int FindClosestPointInRegion_(int leafNodeId, double x, double y, double z, double& dist2);
259
268 double x, double y, double z, double radius, int skipRegion, double& dist2);
269
271
277
278 double FudgeFactor; // a very small distance, relative to the dataset's size
282
283 float MaxWidth;
284
293
295 void operator=(const vtkOctreePointLocator&) = delete;
296};
297#endif
abstract class to quickly locate points in 3-space
object to represent cell connectivity
list of point or cell ids
Definition vtkIdList.h:43
dynamic, self-adjusting array of vtkIdType
a simple class to control print indentation
Definition vtkIndent.h:49
Octree node that has 8 children each of equal size.
an octree spatial decomposition of a set of points
void AddPolys(vtkOctreePointLocatorNode *node, vtkPoints *pts, vtkCellArray *polys)
void FindPointsWithinRadius(double radius, const double x[3], vtkIdList *result) override
Find all points within a specified radius of position x.
void PrintSelf(ostream &os, vtkIndent indent) override
Standard type and print methods.
int FindClosestPointInSphere(double x, double y, double z, double radius, int skipRegion, double &dist2)
Given a location and a radiues, find the closest point within this radius.
vtkIdType FindClosestPointInRegion(int regionId, double *x, double &dist2)
Find the Id of the point in the given leaf region which is closest to the given point.
void ForceBuildLocator() override
Build the locator from the input dataset (even if UseExistingSearchStructure is on).
static vtkOctreePointLocator * New()
void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override
Find the closest N points to a position.
void FindPointsInArea(vtkOctreePointLocatorNode *node, double *area, vtkIdTypeArray *ids)
void AddAllPointsInRegion(vtkOctreePointLocatorNode *node, vtkIdTypeArray *ids)
vtkOctreePointLocator(const vtkOctreePointLocator &)=delete
static void DeleteAllDescendants(vtkOctreePointLocatorNode *octant)
int DivideTest(int size, int level)
int NumberOfLeafNodes
The maximum number of points in a region/octant before it is subdivided.
vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override
Given a position x and a radius r, return the id of the point closest to the point in that radius.
void FindPointsInArea(double *area, vtkIdTypeArray *ids, bool clearArray=true)
Fill ids with points found in area.
double * GetBounds() override
Get the spatial bounds of the entire octree space.
void BuildLeafNodeList(vtkOctreePointLocatorNode *node, int &index)
void AddAllPointsInRegion(vtkOctreePointLocatorNode *node, vtkIdList *ids)
vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, double &dist2)
Find the Id of the point in the given leaf region which is closest to the given point.
int FindRegion(vtkOctreePointLocatorNode *node, double x, double y, double z)
Given a point and a node return the leaf node id that contains the point.
void GetRegionDataBounds(int leafNodeID, double bounds[6])
Get the bounds of the data within the leaf node.
int FindRegion(vtkOctreePointLocatorNode *node, float x, float y, float z)
Given a point and a node return the leaf node id that contains the point.
static void SetDataBoundsToSpatialBounds(vtkOctreePointLocatorNode *node)
void BuildLocatorInternal() override
This function is not pure virtual to maintain backwards compatibility.
vtkIdType FindClosestPoint(double x, double y, double z, double &dist2)
Return the Id of the point that is closest to the given point.
int FindClosestPointInRegion_(int leafNodeId, double x, double y, double z, double &dist2)
Given a leaf node id and point, return the local id and the squared distance between the closest poin...
vtkOctreePointLocatorNode * Top
~vtkOctreePointLocator() override
vtkIdType FindClosestPoint(const double x[3]) override
Return the Id of the point that is closest to the given point.
void GenerateRepresentation(int level, vtkPolyData *pd) override
Create a polydata representation of the boundaries of the octree regions.
int GetRegionContainingPoint(double x, double y, double z)
Get the id of the leaf region containing the specified location.
int MaximumPointsPerRegion
The maximum number of points in a region/octant before it is subdivided.
void DivideRegion(vtkOctreePointLocatorNode *node, int *ordering, int level)
int CreateCubicOctants
If CreateCubicOctants is non-zero, the bounding box of the points will be expanded such that all octa...
vtkOctreePointLocatorNode ** LeafNodeList
void GetRegionBounds(int regionID, double bounds[6])
Get the spatial bounds of octree region.
void BuildLocator() override
Create the octree decomposition of the cells of the data set or data sets.
void operator=(const vtkOctreePointLocator &)=delete
void GetBounds(double *bounds) override
Get the spatial bounds of the entire octree space.
void FreeSearchStructure() override
Delete the octree data structure.
void FindPointsWithinRadius(vtkOctreePointLocatorNode *node, double radiusSquared, const double x[3], vtkIdList *ids)
Recursive helper for public FindPointsWithinRadius.
vtkIdTypeArray * GetPointsInRegion(int leafNodeId)
Get a list of the original IDs of all points in a leaf node.
represent and manipulate 3D points
Definition vtkPoints.h:49
concrete dataset represents vertices, lines, polygons, and triangle strips
int vtkIdType
Definition vtkType.h:332
#define VTK_NEWINSTANCE