VTK  9.3.0
vtkKdTree.h
Go to the documentation of this file.
1// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
2// SPDX-FileCopyrightText: Copyright (c) Sandia Corporation
3// SPDX-License-Identifier: BSD-3-Clause
4
44#ifndef vtkKdTree_h
45#define vtkKdTree_h
46
47#include "vtkCommonDataModelModule.h" // For export macro
48#include "vtkLocator.h"
49
50VTK_ABI_NAMESPACE_BEGIN
51class vtkTimerLog;
52class vtkIdList;
53class vtkIdTypeArray;
54class vtkIntArray;
55class vtkPointSet;
56class vtkPoints;
57class vtkCellArray;
58class vtkCell;
59class vtkKdNode;
60class vtkBSPCuts;
63
64class VTKCOMMONDATAMODEL_EXPORT vtkKdTree : public vtkLocator
65{
66public:
67 vtkTypeMacro(vtkKdTree, vtkLocator);
68 void PrintSelf(ostream& os, vtkIndent indent) override;
69
70 static vtkKdTree* New();
71
73
76 vtkBooleanMacro(Timing, vtkTypeBool);
77 vtkSetMacro(Timing, vtkTypeBool);
78 vtkGetMacro(Timing, vtkTypeBool);
80
82
85 vtkSetMacro(MinCells, int);
86 vtkGetMacro(MinCells, int);
88
96 vtkGetMacro(NumberOfRegionsOrLess, int);
97 vtkSetMacro(NumberOfRegionsOrLess, int);
98
106 vtkGetMacro(NumberOfRegionsOrMore, int);
107 vtkSetMacro(NumberOfRegionsOrMore, int);
108
116 vtkGetMacro(FudgeFactor, double);
117 vtkSetMacro(FudgeFactor, double);
118
124 vtkGetObjectMacro(Cuts, vtkBSPCuts);
125
132 void SetCuts(vtkBSPCuts* cuts);
133
138
143
148
153
158
163
168
183 void SetDataSet(vtkDataSet* set) override;
184
189 virtual void AddDataSet(vtkDataSet* set);
190
192
195 virtual void RemoveDataSet(int index);
196 virtual void RemoveDataSet(vtkDataSet* set);
197 virtual void RemoveAllDataSets();
199
204
215
220 vtkDataSet* GetDataSet() override { return this->GetDataSet(0); }
221
223
226 vtkGetObjectMacro(DataSets, vtkDataSetCollection);
228
234
239 void GetBounds(double* bounds);
240
249 void SetNewBounds(double* bounds);
250
252
255 vtkGetMacro(NumberOfRegions, int);
257
261 void GetRegionBounds(int regionID, double bounds[6]);
262
266 void GetRegionDataBounds(int regionID, double bounds[6]);
267
269
272 void PrintTree();
275
279 void PrintRegion(int id);
280
293 void CreateCellLists(int dataSetIndex, int* regionReqList, int reqListSize);
294 void CreateCellLists(vtkDataSet* set, int* regionReqList, int reqListSize);
295 void CreateCellLists(int* regionReqList, int listSize);
297
299
306 vtkSetMacro(IncludeRegionBoundaryCells, vtkTypeBool);
307 vtkGetMacro(IncludeRegionBoundaryCells, vtkTypeBool);
308 vtkBooleanMacro(IncludeRegionBoundaryCells, vtkTypeBool);
310
315
320 vtkIdList* GetCellList(int regionID);
321
333
335
356 vtkIntArray* regions, int set, vtkIdList* inRegionCells, vtkIdList* onBoundaryCells);
358 vtkIntArray* regions, vtkDataSet* set, vtkIdList* inRegionCells, vtkIdList* onBoundaryCells);
360 vtkIntArray* regions, vtkIdList* inRegionCells, vtkIdList* onBoundaryCells);
362
364
371 int GetRegionContainingCell(int set, vtkIdType cellID);
374
384
388 int GetRegionContainingPoint(double x, double y, double z);
389
395 void BuildLocator() override;
396
400 void ForceBuildLocator() override;
401
416 int MinimalNumberOfConvexSubRegions(vtkIntArray* regionIdList, double** convexRegionBounds);
417
426 const double directionOfProjection[3], vtkIntArray* orderedList);
427
436 vtkIntArray* regionIds, const double directionOfProjection[3], vtkIntArray* orderedList);
437
446 const double directionOfProjection[3], vtkIntArray* orderedList);
447
456 vtkIntArray* regionIds, const double directionOfProjection[3], vtkIntArray* orderedList);
457
459
474 void BuildLocatorFromPoints(vtkPoints** ptArray, int numPtArrays);
476
492
494
500 vtkIdType FindPoint(double x, double y, double z);
502
504
509 vtkIdType FindClosestPoint(double* x, double& dist2);
510 vtkIdType FindClosestPoint(double x, double y, double z, double& dist2);
512
518 vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double& dist2);
519
521
526 vtkIdType FindClosestPointInRegion(int regionId, double* x, double& dist2);
527 vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, double& dist2);
529
536 void FindPointsWithinRadius(double R, const double x[3], vtkIdList* result);
537
546 void FindClosestNPoints(int N, const double x[3], vtkIdList* result);
547
553
558 void FreeSearchStructure() override;
559
565 void GenerateRepresentation(int level, vtkPolyData* pd) override;
566
571 void GenerateRepresentation(int* regionList, int len, vtkPolyData* pd);
572
574
580 vtkBooleanMacro(GenerateRepresentationUsingDataBounds, vtkTypeBool);
581 vtkSetMacro(GenerateRepresentationUsingDataBounds, vtkTypeBool);
582 vtkGetMacro(GenerateRepresentationUsingDataBounds, vtkTypeBool);
584
588 virtual void PrintTiming(ostream& os, vtkIndent indent);
589
594 virtual int NewGeometry();
595
601 virtual int NewGeometry(vtkDataSet** sets, int numDataSets);
602
608 virtual void InvalidateGeometry();
609
616
623 void FindPointsInArea(double* area, vtkIdTypeArray* ids, bool clearArray = true);
624
625protected:
627 ~vtkKdTree() override;
628
629 void BuildLocatorInternal() override;
630
633
635
636 int ProcessUserDefinedCuts(double* bounds);
637
638 void SetCuts(vtkBSPCuts* cuts, int userDefined);
639
646
654 int DivideTest(int numberOfPoints, int level);
655
656 enum
657 {
658 XDIM = 0, // don't change these values
659 YDIM = 1,
660 ZDIM = 2
661 };
662
664
666 vtkKdNode** RegionList; // indexed by region ID
667
669
671
674 void SetActualLevel() { this->Level = vtkKdTree::ComputeLevel(this->Top); }
675
681 void GetRegionsAtLevel(int level, vtkKdNode** nodes);
682
688 static void GetLeafNodeIds(vtkKdNode* node, vtkIntArray* ids);
689
695
701 int GetDataSetsNumberOfCells(int set1, int set2);
702
709 void ComputeCellCenter(vtkDataSet* set, int cellId, float* center);
710 void ComputeCellCenter(vtkDataSet* set, int cellId, double* center);
711
722 float* ComputeCellCenters(int set);
724
726
732 void UpdateProgress(double amount);
733
735
738 vtkSetClampMacro(Progress, double, 0.0, 1.0);
739 vtkGetMacro(Progress, double);
741
742 // So that each suboperation can report progress
743 // in [0,1], yet we will be able to report a global
744 // progress. Sub-operations must use UpdateSubOperationProgress()
745 // for this to work.
748
749 // Update progress for a sub-operation. \c amount goes from 0.0 to 1.0.
750 // Actual progress is given by
751 // (this->ProgressOffset + this->ProgressScale* amount).
752 void UpdateSubOperationProgress(double amount);
753
754 static void SetNewBounds_(vtkKdNode* kd, double* b, int* fixDim);
755 static void CopyChildNodes(vtkKdNode* to, vtkKdNode* from);
756 static void CopyKdNode(vtkKdNode* to, vtkKdNode* from);
759
760 // Recursive helper for public FindPointsWithinRadius
761 void FindPointsWithinRadius(vtkKdNode* node, double R2, const double x[3], vtkIdList* ids);
762
763 // Recursive helper for public FindPointsWithinRadius
765
766 // Recursive helper for public FindPointsInArea
767 void FindPointsInArea(vtkKdNode* node, double* area, vtkIdTypeArray* ids);
768
769 // Recursive helper for public FindPointsInArea
771
772 int DivideRegion(vtkKdNode* kd, float* c1, int* ids, int nlevels);
773
774 void DoMedianFind(vtkKdNode* kd, float* c1, int* ids, int d1, int d2, int d3);
775
777
779 {
780 vtkDataSet* dataSet; // cell lists for which data set
781 int* regionIds; // nullptr if listing all regions
786 };
787
789 vtkIdList* GetList(int regionId, vtkIdList** which);
790
791 void ComputeCellCenter(vtkCell* cell, double* center, double* weights);
792
795 vtkKdNode* kd, vtkPoints* pts, vtkCellArray* polys, int level);
796
799 vtkKdNode* kd, vtkPoints* pts, vtkCellArray* polys, int level);
800
801 void AddPolys(vtkKdNode* kd, vtkPoints* pts, vtkCellArray* polys);
802
803 void printTree_(int verbose);
804
806 int regionId, float* point, int** pointsSoFar, int* len, float tolerance, float tolerance2);
807
808 int SearchRegionForDuplicate(float* point, int* pointsSoFar, int len, float tolerance2);
809
810 int FindClosestPointInRegion_(int regionId, double x, double y, double z, double& dist2);
811
813 double x, double y, double z, double radius, int skipRegion, double& dist2);
814
816 vtkIntArray* IdsOfInterest, const double dop[3], vtkIntArray* orderedList);
817
819 vtkIntArray* IdsOfInterest, const double dir[3], int nextId);
820
822 vtkIntArray* IdsOfInterest, const double pos[3], vtkIntArray* orderedList);
823
825 vtkIntArray* IdsOfInterest, const double pos[3], int nextId);
826
827 static int ConvexSubRegions_(int* ids, int len, vtkKdNode* tree, vtkKdNode** nodes);
828 static int FoundId(vtkIntArray* idArray, int id);
829
830 void SetInputDataInfo(int i, int dims[3], double origin[3], double spacing[3]);
831 int CheckInputDataInfo(int i, int dims[3], double origin[3], double spacing[3]);
833
834 static void printTree_P(vtkKdNode* kd, int depth, int verbose);
835
836 static int MidValue(int dim, float* c1, int nvals, double& coord);
837
838 static int Select(int dim, float* c1, int* ids, int nvals, double& coord);
839 static float FindMaxLeftHalf(int dim, float* c1, int K);
840 static void Select_(int dim, float* X, int* ids, int L, int R, int K);
841
842 static int ComputeLevel(vtkKdNode* kd);
843 static int SelfOrder(int id, vtkKdNode* kd);
844 static int findRegion(vtkKdNode* node, float x, float y, float z);
845 static int findRegion(vtkKdNode* node, double x, double y, double z);
846
847 static vtkKdNode** GetRegionsAtLevel_(int level, vtkKdNode** nodes, vtkKdNode* kd);
848
849 static void AddNewRegions(vtkKdNode* kd, float* c1, int midpt, int dim, double coord);
850
852
855
857 double CellBoundsCache[6]; // to optimize IntersectsCell()
858
860
861 struct cellList_ CellList;
862
863 // Region Ids, by data set by cell id - this list is large (one
864 // int per cell) but accelerates creation of cell lists
865
867
869 int NumberOfRegions; // number of leaf nodes
870
872 double FudgeFactor; // a very small distance, relative to the dataset's size
873
874 // These instance variables are used by the special locator created
875 // to find duplicate points. (BuildLocatorFromPoints)
876
881
882 float MaxWidth;
883
884 // These Last* values are here to save state so we can
885 // determine later if k-d tree must be rebuilt.
886
893 double* LastBounds;
896
898 double Progress;
899
900 vtkKdTree(const vtkKdTree&) = delete;
901 void operator=(const vtkKdTree&) = delete;
902};
903VTK_ABI_NAMESPACE_END
904#endif
This class represents an axis-aligned Binary Spatial Partitioning of a 3D space.
Definition vtkBSPCuts.h:31
Perform calculations (mostly intersection calculations) on regions of a 3D binary spatial partitionin...
object to represent cell connectivity
abstract class to specify cell behavior
Definition vtkCell.h:50
maintain an unordered list of dataset objects
abstract class to specify dataset behavior
Definition vtkDataSet.h:53
list of point or cell ids
Definition vtkIdList.h:23
dynamic, self-adjusting array of vtkIdType
a simple class to control print indentation
Definition vtkIndent.h:29
dynamic, self-adjusting array of int
Definition vtkIntArray.h:35
This class represents a single spatial region in an 3D axis aligned binary spatial partitioning.
Definition vtkKdNode.h:32
a Kd-tree spatial decomposition of a set of points
Definition vtkKdTree.h:65
void SelfRegister(vtkKdNode *kd)
vtkIdList * GetBoundaryCellList(int regionID)
The cell list obtained with GetCellList is the list of all cells such that their centroid is containe...
void NewPartitioningRequest(int req)
void SetInputDataInfo(int i, int dims[3], double origin[3], double spacing[3])
virtual void RemoveAllDataSets()
Remove the given data set.
int * LastDataSetType
Definition vtkKdTree.h:891
vtkTypeBool Timing
Definition vtkKdTree.h:871
vtkIdTypeArray * GetPointsInRegion(int regionId)
Get a list of the original IDs of all points in a region.
int DivideRegion(vtkKdNode *kd, float *c1, int *ids, int nlevels)
static void CopyKdNode(vtkKdNode *to, vtkKdNode *from)
int MinimalNumberOfConvexSubRegions(vtkIntArray *regionIdList, double **convexRegionBounds)
Given a list of region IDs, determine the decomposition of these regions into the minimal number of c...
vtkDataSetCollection * DataSets
Definition vtkKdTree.h:725
void CreateCellLists(int *regionReqList, int listSize)
int ValidDirections
Definition vtkKdTree.h:663
vtkIdType FindPoint(double x, double y, double z)
Find the Id of the point that was previously supplied to BuildLocatorFromPoints().
int NumberOfRegions
Definition vtkKdTree.h:869
int GetRegionContainingCell(vtkIdType cellID)
Get the id of the region containing the cell centroid.
void GetRegionDataBounds(int regionID, double bounds[6])
Get the bounds of the data within the k-d tree region.
void InitializeCellLists()
virtual void InvalidateGeometry()
Forget about the last geometry used.
void OmitYZPartitioning()
Omit partitions along the Y and Z axes, yielding slabs along X.
vtkTypeBool IncludeRegionBoundaryCells
Definition vtkKdTree.h:856
static int SelfOrder(int id, vtkKdNode *kd)
void OmitZXPartitioning()
Omit partitions along the Z and X axes, yielding slabs along Y.
vtkIdType GetCellLists(vtkIntArray *regions, vtkDataSet *set, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells)
For a list of regions, get two cell lists.
int LastDataCacheSize
Definition vtkKdTree.h:888
float MaxWidth
Definition vtkKdTree.h:882
vtkIdType GetCellLists(vtkIntArray *regions, int set, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells)
For a list of regions, get two cell lists.
void BuildRegionList()
void OmitNoPartitioning()
Partition along all three axes - this is the default.
void BuildLocatorInternal() override
This function is not pure virtual to maintain backwards compatibility.
int GetNumberOfCells()
Returns the total number of cells in all the data sets.
void GenerateRepresentationDataBounds(int level, vtkPolyData *pd)
vtkDataSet * GetDataSet(int n)
Get the nth defined data set in the spatial partitioning.
float * ComputeCellCenters(int set)
vtkIdTypeArray * BuildMapForDuplicatePoints(float tolerance)
This call returns a mapping from the original point IDs supplied to BuildLocatorFromPoints to a subse...
void printTree_(int verbose)
void SetDataSet(vtkDataSet *set) override
This class can compute a spatial decomposition based on the cells in a list of one or more input data...
int NumberOfRegionsOrLess
Definition vtkKdTree.h:853
static int Select(int dim, float *c1, int *ids, int nvals, double &coord)
void UpdateSubOperationProgress(double amount)
void CreateCellLists()
vtkDataSet ** LastInputDataSets
Definition vtkKdTree.h:889
static int ViewOrderRegionsInDirection_P(vtkKdNode *node, vtkIntArray *list, vtkIntArray *IdsOfInterest, const double dir[3], int nextId)
void ComputeCellCenter(vtkCell *cell, double *center, double *weights)
double * LastInputDataInfo
Definition vtkKdTree.h:892
static vtkKdNode * CopyTree(vtkKdNode *kd)
Create a copy of the binary tree representation of the k-d tree spatial partitioning provided.
vtkBSPCuts * Cuts
Definition vtkKdTree.h:897
vtkBSPIntersections * BSPCalculator
Definition vtkKdTree.h:631
void SetCuts(vtkBSPCuts *cuts, int userDefined)
vtkKdNode ** RegionList
Definition vtkKdTree.h:666
int SearchNeighborsForDuplicate(int regionId, float *point, int **pointsSoFar, int *len, float tolerance, float tolerance2)
void GenerateRepresentation(int level, vtkPolyData *pd) override
Create a polydata representation of the boundaries of the k-d tree regions.
void AddAllPointsInRegion(vtkKdNode *node, vtkIdList *ids)
int LastNumDataSets
Definition vtkKdTree.h:887
static float FindMaxLeftHalf(int dim, float *c1, int K)
int * LocatorRegionLocation
Definition vtkKdTree.h:880
void CreateCellLists(int dataSetIndex, int *regionReqList, int reqListSize)
Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in...
void PrintTree()
Print out nodes of kd tree.
void FreeSearchStructure() override
Delete the k-d tree data structure.
virtual void RemoveDataSet(vtkDataSet *set)
Remove the given data set.
int CheckInputDataInfo(int i, int dims[3], double origin[3], double spacing[3])
virtual int NewGeometry(vtkDataSet **sets, int numDataSets)
Return 1 if the geometry of these data sets differs for the geometry of the last data sets used to bu...
static int findRegion(vtkKdNode *node, float x, float y, float z)
void DeleteCellLists()
Free the memory used by the cell lists.
vtkIdType * LastNumPoints
Definition vtkKdTree.h:894
void _generateRepresentationWholeSpace(vtkKdNode *kd, vtkPoints *pts, vtkCellArray *polys, int level)
void ClearLastBuildCache()
static int ViewOrderRegionsFromPosition_P(vtkKdNode *node, vtkIntArray *list, vtkIntArray *IdsOfInterest, const double pos[3], int nextId)
vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2)
Given a position x and a radius r, return the id of the point closest to the point in that radius.
void OmitYPartitioning()
Omit partitions along the Y axis, yielding shafts in the Y direction.
void GetBounds(double *bounds)
Get the spatial bounds of the entire k-d tree space.
int NumberOfLocatorPoints
Definition vtkKdTree.h:877
static void SetDataBoundsToSpatialBounds(vtkKdNode *kd)
static void CopyChildNodes(vtkKdNode *to, vtkKdNode *from)
float * ComputeCellCenters(vtkDataSet *set)
double * LastBounds
Definition vtkKdTree.h:893
int GetNumberOfDataSets()
Get the number of data sets included in spatial partitioning.
static int ComputeLevel(vtkKdNode *kd)
int GetRegionContainingCell(int set, vtkIdType cellID)
Get the id of the region containing the cell centroid.
static vtkKdTree * New()
static int findRegion(vtkKdNode *node, double x, double y, double z)
void UpdateProgress(double amount)
Modelled on vtkAlgorithm::UpdateProgress().
void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result)
Find all points within a specified radius R of position x.
vtkDataSet * GetDataSet() override
Return the 0'th data set.
Definition vtkKdTree.h:220
int NumberOfRegionsOrMore
Definition vtkKdTree.h:854
void SetNewBounds(double *bounds)
There are certain applications where you want the bounds of the k-d tree space to be at least as larg...
int ProcessUserDefinedCuts(double *bounds)
static void AddNewRegions(vtkKdNode *kd, float *c1, int midpt, int dim, double coord)
static int FoundId(vtkIntArray *idArray, int id)
double ProgressScale
Definition vtkKdTree.h:746
void OmitZPartitioning()
Omit partitions along the Z axis, yielding shafts in the Z direction.
void AddAllPointsInRegion(vtkKdNode *node, vtkIdTypeArray *ids)
void GenerateRepresentation(int *regionList, int len, vtkPolyData *pd)
Generate a polygonal representation of a list of regions.
int * LocatorIds
Definition vtkKdTree.h:879
int ViewOrderRegionsInDirection(vtkIntArray *regionIds, const double directionOfProjection[3], vtkIntArray *orderedList)
Given a direction of projection and a list of k-d tree region IDs, this method, creates a list of the...
void FindPointsWithinRadius(vtkKdNode *node, double R2, const double x[3], vtkIdList *ids)
double ProgressOffset
Definition vtkKdTree.h:747
void ComputeCellCenter(vtkDataSet *set, int cellId, double *center)
void BuildLocatorFromPoints(vtkPoints **ptArray, int numPtArrays)
This is a special purpose locator that builds a k-d tree to find duplicate and near-by points.
static void Select_(int dim, float *X, int *ids, int L, int R, int K)
static vtkKdNode ** GetRegionsAtLevel_(int level, vtkKdNode **nodes, vtkKdNode *kd)
void operator=(const vtkKdTree &)=delete
void BuildLocator() override
Create the k-d tree decomposition of the cells of the data set or data sets.
void SetActualLevel()
Definition vtkKdTree.h:674
void _generateRepresentationDataBounds(vtkKdNode *kd, vtkPoints *pts, vtkCellArray *polys, int level)
void BuildLocatorFromPoints(vtkPointSet *pointset)
This is a special purpose locator that builds a k-d tree to find duplicate and near-by points.
void PrintVerboseTree()
Print out nodes of kd tree.
vtkIdType FindClosestPointInRegion(int regionId, double *x, double &dist2)
Find the Id of the point in the given region which is closest to the given point.
vtkIdType FindClosestPoint(double *x, double &dist2)
Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to...
double Progress
Definition vtkKdTree.h:898
int ViewOrderRegionsInDirection_(vtkIntArray *IdsOfInterest, const double dop[3], vtkIntArray *orderedList)
static int MidValue(int dim, float *c1, int nvals, double &coord)
int UserDefinedCuts
Definition vtkKdTree.h:632
virtual int SelectCutDirection(vtkKdNode *kd)
~vtkKdTree() override
vtkIdType FindClosestPoint(double x, double y, double z, double &dist2)
Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to...
vtkTypeBool GenerateRepresentationUsingDataBounds
Definition vtkKdTree.h:859
int MinCells
Definition vtkKdTree.h:868
virtual void AddDataSet(vtkDataSet *set)
This class can compute a spatial decomposition based on the cells in a list of one or more input data...
int ViewOrderRegionsFromPosition(vtkIntArray *regionIds, const double directionOfProjection[3], vtkIntArray *orderedList)
Given a camera position and a list of k-d tree region IDs, this method, creates a list of the k-d tre...
double FudgeFactor
Definition vtkKdTree.h:872
void ComputeCellCenter(vtkDataSet *set, int cellId, float *center)
Get or compute the center of one cell.
void CreateCellLists(vtkDataSet *set, int *regionReqList, int reqListSize)
virtual void PrintTiming(ostream &os, vtkIndent indent)
Print timing of k-d tree build.
void FindPointsInArea(vtkKdNode *node, double *area, vtkIdTypeArray *ids)
static void printTree_P(vtkKdNode *kd, int depth, int verbose)
void UpdateBuildTime()
Save enough state so NewGeometry() can work, and update the BuildTime time stamp.
virtual int NewGeometry()
Return 1 if the geometry of the input data sets has changed since the last time the k-d tree was buil...
int FindClosestPointInSphere(double x, double y, double z, double radius, int skipRegion, double &dist2)
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void SetCalculator(vtkKdNode *kd)
vtkKdTree(const vtkKdTree &)=delete
int GetRegionContainingCell(vtkDataSet *set, vtkIdType cellID)
Get the id of the region containing the cell centroid.
int ViewOrderAllRegionsFromPosition(const double directionOfProjection[3], vtkIntArray *orderedList)
Given a camera position (typically obtained with vtkCamera::GetPosition()), this method,...
int ViewOrderRegionsFromPosition_(vtkIntArray *IdsOfInterest, const double pos[3], vtkIntArray *orderedList)
vtkTimerLog * TimerLog
Definition vtkKdTree.h:668
vtkIdList * GetCellList(int regionID)
Get the cell list for a region.
void GetRegionsAtLevel(int level, vtkKdNode **nodes)
Get back a list of the nodes at a specified level, nodes must be preallocated to hold 2^^(level) node...
unsigned long * LastDataSetObserverTags
Definition vtkKdTree.h:890
void OmitXPartitioning()
Omit partitions along the X axis, yielding shafts in the X direction.
int * AllGetRegionContainingCell()
Get a list (in order by data set by cell id) of the region IDs of the region containing the centroid ...
static void GetLeafNodeIds(vtkKdNode *node, vtkIntArray *ids)
Adds to the vtkIntArray the list of region IDs of all leaf nodes in the given node.
int * CellRegionList
Definition vtkKdTree.h:866
int ViewOrderAllRegionsInDirection(const double directionOfProjection[3], vtkIntArray *orderedList)
Given a direction of projection (typically obtained with vtkCamera::GetDirectionOfProjection()),...
void DoMedianFind(vtkKdNode *kd, float *c1, int *ids, int d1, int d2, int d3)
void PrintRegion(int id)
Print out leaf node data for given id.
static void SetNewBounds_(vtkKdNode *kd, double *b, int *fixDim)
vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, double &dist2)
Find the Id of the point in the given region which is closest to the given point.
int DivideTest(int numberOfPoints, int level)
Prior to dividing a region at level "level", of size "numberOfPoints", apply the tests implied by Min...
virtual void RemoveDataSet(int index)
Remove the given data set.
static int ConvexSubRegions_(int *ids, int len, vtkKdNode *tree, vtkKdNode **nodes)
void OmitXYPartitioning()
Omit partitions along the X and Y axes, yielding slabs along Z.
void BuildLocatorFromPoints(vtkPoints *ptArray)
This is a special purpose locator that builds a k-d tree to find duplicate and near-by points.
void GenerateRepresentationWholeSpace(int level, vtkPolyData *pd)
vtkIdList * GetList(int regionId, vtkIdList **which)
int SearchRegionForDuplicate(float *point, int *pointsSoFar, int len, float tolerance2)
static void DeleteAllDescendants(vtkKdNode *nd)
void ForceBuildLocator() override
Build the locator from the input dataset (even if UseExistingSearchStructure is on).
void AddPolys(vtkKdNode *kd, vtkPoints *pts, vtkCellArray *polys)
vtkIdType FindPoint(double *x)
Find the Id of the point that was previously supplied to BuildLocatorFromPoints().
vtkIdType GetCellLists(vtkIntArray *regions, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells)
For a list of regions, get two cell lists.
vtkIdType * LastNumCells
Definition vtkKdTree.h:895
void GetRegionBounds(int regionID, double bounds[6])
Get the spatial bounds of k-d tree region.
int GetRegionContainingPoint(double x, double y, double z)
Get the id of the region containing the specified location.
int GetDataSetsNumberOfCells(int set1, int set2)
Returns the total number of cells in data set 1 through data set 2.
void SetCuts(vtkBSPCuts *cuts)
Normally the k-d tree is computed from the dataset(s) provided in SetDataSet.
void FindPointsInArea(double *area, vtkIdTypeArray *ids, bool clearArray=true)
Fill ids with points found in area.
void FindClosestNPoints(int N, const double x[3], vtkIdList *result)
Find the closest N points to a position.
static void ZeroNumberOfPoints(vtkKdNode *kd)
float * ComputeCellCenters()
Compute and return a pointer to a list of all cell centers, in order by data set by cell Id.
vtkKdNode * Top
Definition vtkKdTree.h:665
int FindClosestPointInRegion_(int regionId, double x, double y, double z, double &dist2)
int GetDataSetIndex(vtkDataSet *set)
Return the index of the given data set.
float * LocatorPoints
Definition vtkKdTree.h:878
abstract base class for objects that accelerate spatial searches
Definition vtkLocator.h:59
concrete class for storing a set of points
Definition vtkPointSet.h:59
represent and manipulate 3D points
Definition vtkPoints.h:29
concrete dataset represents vertices, lines, polygons, and triangle strips
Definition vtkPolyData.h:80
Timer support and logging.
Definition vtkTimerLog.h:85
vtkIdList ** boundaryCells
Definition vtkKdTree.h:784
vtkIdList ** cells
Definition vtkKdTree.h:783
vtkIdList * emptyList
Definition vtkKdTree.h:785
vtkDataSet * dataSet
Definition vtkKdTree.h:780
int vtkTypeBool
Definition vtkABI.h:64
int vtkIdType
Definition vtkType.h:315