| 72 | */ |
| 73 | vtkSetVector3Macro(Divisions, int); |
| 74 | vtkGetVectorMacro(Divisions, int, 3); |
| 75 | ///@} |
| 76 | |
| 77 | ///@{ |
| 78 | /** |
| 79 | * Specify the average number of points in each bucket. |
| 80 | */ |
| 81 | vtkSetClampMacro(NumberOfPointsPerBucket, int, 1, VTK_INT_MAX); |
| 82 | vtkGetMacro(NumberOfPointsPerBucket, int); |
| 83 | ///@} |
| 84 | |
| 85 | // Reuse any superclass signatures that we don't override. |
| 86 | using vtkAbstractPointLocator::FindClosestPoint; |
| 87 | |
| 88 | /** |
| 89 | * Given a position x, return the id of the point closest to it. Alternative |
| 90 | * method requires separate x-y-z values. |
| 91 | * These methods are thread safe if BuildLocator() is directly or |
| 92 | * indirectly called from a single thread first. |
| 93 | */ |
| 94 | vtkIdType FindClosestPoint(const double x[3]) override; |
| 95 | |
| 96 | ///@{ |
| 97 | /** |
| 98 | * Given a position x and a radius r, return the id of the point |
| 99 | * closest to the point in that radius. |
| 100 | * These methods are thread safe if BuildLocator() is directly or |
| 101 | * indirectly called from a single thread first. dist2 returns the squared |
| 102 | * distance to the point. |
| 103 | */ |
| 104 | vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double& dist2) override; |
| 105 | virtual vtkIdType FindClosestPointWithinRadius( |
| 106 | double radius, const double x[3], double inputDataLength, double& dist2); |
| 107 | ///@} |
| 108 | |
| 109 | /** |
| 110 | * Initialize the point insertion process. The newPts is an object |
| 111 | * representing point coordinates into which incremental insertion methods |
| 112 | * place their data. Bounds are the box that the points lie in. |
| 113 | * Not thread safe. |
| 114 | */ |
| 115 | int InitPointInsertion(vtkPoints* newPts, const double bounds[6]) override; |
| 116 | |
| 117 | /** |
| 118 | * Initialize the point insertion process. The newPts is an object |
| 119 | * representing point coordinates into which incremental insertion methods |
| 120 | * place their data. Bounds are the box that the points lie in. |
| 121 | * Not thread safe. |
| 122 | */ |
| 123 | int InitPointInsertion(vtkPoints* newPts, const double bounds[6], vtkIdType estNumPts) override; |
| 124 | |
| 125 | /** |
| 126 | * Incrementally insert a point into search structure with a particular |
| 127 | * index value. You should use the method IsInsertedPoint() to see whether |
| 128 | * this point has already been inserted (that is, if you desire to prevent |
| 129 | * duplicate points). Before using this method you must make sure that |
| 130 | * newPts have been supplied, the bounds has been set properly, and that |
| 131 | * divs are properly set. (See InitPointInsertion().) |
nothing calls this directly
no test coverage detected