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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkAbstractPointLocator.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 "vtkAbstractPointLocator.h"
#include "vtkDataSet.h"
#include "vtkIdList.h"
vtkAbstractPointLocator::vtkAbstractPointLocator()
{
for(int i=0;i<6;i++)
{
this->Bounds[i] = 0;
}
}
vtkAbstractPointLocator::~vtkAbstractPointLocator()
{
}
// Given a position x-y-z, return the id of the point closest to it.
vtkIdType vtkAbstractPointLocator::FindClosestPoint(double x, double y, double z)
{
double xyz[3];
xyz[0] = x; xyz[1] = y; xyz[2] = z;
return this->FindClosestPoint(xyz);
}
void vtkAbstractPointLocator::FindClosestNPoints(int N, double x,
double y, double z,
vtkIdList *result)
{
double p[3];
p[0] = x;
p[1] = y;
p[2] = z;
this->FindClosestNPoints(N,p,result);
}
void vtkAbstractPointLocator::FindPointsWithinRadius(double R, double x,
double y, double z,
vtkIdList *result)
{
double p[3];
p[0] = x;
p[1] = y;
p[2] = z;
this->FindPointsWithinRadius(R,p,result);
}
void vtkAbstractPointLocator::GetBounds(double* bnds)
{
for(int i=0;i<6;i++)
{
bnds[i] = this->Bounds[i];
}
}
void vtkAbstractPointLocator::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
for(int i=0;i<6;i++)
{
os << indent << "Bounds[" << i << "]: " << this->Bounds[i] << "\n";
}
}
|
