1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkAbstractPointLocator.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
// .NAME vtkAbstractPointLocator - abstract class to quickly locate points in 3-space
// .SECTION Description
// vtkAbstractPointLocator is an abstract spatial search object to quickly locate points
// in 3D. vtkAbstractPointLocator works by dividing a specified region of space into
// "rectangular" buckets, and then keeping a list of points that
// lie in each bucket. Typical operation involves giving a position in 3D
// and finding the closest point. The points are provided from the specified
// dataset input.
#ifndef vtkAbstractPointLocator_h
#define vtkAbstractPointLocator_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkLocator.h"
class vtkIdList;
class VTKCOMMONDATAMODEL_EXPORT vtkAbstractPointLocator : public vtkLocator
{
public:
vtkTypeMacro(vtkAbstractPointLocator,vtkLocator);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// Given a position x, return the id of the point closest to it. Alternative
// method requires separate x-y-z values.
// These methods are thread safe if BuildLocator() is directly or
// indirectly called from a single thread first.
virtual vtkIdType FindClosestPoint(const double x[3]) = 0;
vtkIdType FindClosestPoint(double x, double y, double z);
// Description:
// Given a position x and a radius r, return the id of the point
// closest to the point in that radius.
// dist2 returns the squared distance to the point.
virtual vtkIdType FindClosestPointWithinRadius(
double radius, const double x[3], double& dist2) = 0;
// Description:
// Find the closest N points to a position. This returns the closest
// N points to a position. A faster method could be created that returned
// N close points to a position, but necessarily the exact N closest.
// The returned points are sorted from closest to farthest.
// These methods are thread safe if BuildLocator() is directly or
// indirectly called from a single thread first.
virtual void FindClosestNPoints(
int N, const double x[3], vtkIdList *result) = 0;
void FindClosestNPoints(int N, double x, double y, double z,
vtkIdList *result);
// Description:
// Find all points within a specified radius R of position x.
// The result is not sorted in any specific manner.
// These methods are thread safe if BuildLocator() is directly or
// indirectly called from a single thread first.
virtual void FindPointsWithinRadius(double R, const double x[3],
vtkIdList *result) = 0;
void FindPointsWithinRadius(double R, double x, double y, double z,
vtkIdList *result);
// Description:
// Provide an accessor to the bounds.
virtual double *GetBounds() { return this->Bounds; }
virtual void GetBounds(double*);
// Description:
// See vtkLocator interface documentation.
// These methods are not thread safe.
virtual void FreeSearchStructure() = 0;
virtual void BuildLocator() = 0;
virtual void GenerateRepresentation(int level, vtkPolyData *pd) = 0;
protected:
vtkAbstractPointLocator();
virtual ~vtkAbstractPointLocator();
double Bounds[6]; // bounds of points
private:
vtkAbstractPointLocator(const vtkAbstractPointLocator&); // Not implemented.
void operator=(const vtkAbstractPointLocator&); // Not implemented.
};
#endif
|
