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
101
102
103
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkKdTreePointLocator.cxx
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.
=========================================================================*/
#include "vtkKdTreePointLocator.h"
#include "vtkKdTree.h"
#include "vtkObjectFactory.h"
#include "vtkPointSet.h"
vtkStandardNewMacro(vtkKdTreePointLocator);
vtkKdTreePointLocator::vtkKdTreePointLocator()
{
this->KdTree = 0;
}
vtkKdTreePointLocator::~vtkKdTreePointLocator()
{
if(this->KdTree)
{
this->KdTree->Delete();
}
}
vtkIdType vtkKdTreePointLocator::FindClosestPoint(const double x[3])
{
this->BuildLocator();
double dist2;
return this->KdTree->FindClosestPoint(x[0], x[1], x[2], dist2);
}
vtkIdType vtkKdTreePointLocator::FindClosestPointWithinRadius(
double radius, const double x[3], double& dist2)
{
this->BuildLocator();
return this->KdTree->FindClosestPointWithinRadius(radius, x, dist2);
}
void vtkKdTreePointLocator::FindClosestNPoints(int N, const double x[3],
vtkIdList* result)
{
this->BuildLocator();
this->KdTree->FindClosestNPoints(N, x, result);
}
void vtkKdTreePointLocator::FindPointsWithinRadius(double R, const double x[3],
vtkIdList * result)
{
this->BuildLocator();
this->KdTree->FindPointsWithinRadius(R, x, result);
}
void vtkKdTreePointLocator::FreeSearchStructure()
{
if(this->KdTree)
{
this->KdTree->Delete();
this->KdTree = 0;
}
}
void vtkKdTreePointLocator::BuildLocator()
{
if(!this->KdTree)
{
vtkPointSet* pointSet = vtkPointSet::SafeDownCast(this->GetDataSet());
if(!pointSet)
{
vtkErrorMacro("vtkKdTreePointLocator requires a PointSet to build locator.");
return;
}
this->KdTree = vtkKdTree::New();
this->KdTree->BuildLocatorFromPoints(pointSet);
this->KdTree->GetBounds(this->Bounds);
this->Modified();
}
}
void vtkKdTreePointLocator::GenerateRepresentation(int level, vtkPolyData *pd)
{
this->BuildLocator();
this->KdTree->GenerateRepresentation(level, pd);
}
void vtkKdTreePointLocator::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "KdTree " << this->KdTree << "\n";
}
|
