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
|
/*=========================================================================
*
* Copyright UMC Utrecht and contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkANNStandardTreeSearch_hxx
#define itkANNStandardTreeSearch_hxx
#include "itkANNStandardTreeSearch.h"
namespace itk
{
/**
* ************************ Constructor *************************
*/
template <class TBinaryTree>
ANNStandardTreeSearch<TBinaryTree>::ANNStandardTreeSearch()
{
this->m_ErrorBound = 0.0;
} // end Constructor
/**
* ************************ Search *************************
*/
template <class TBinaryTree>
void
ANNStandardTreeSearch<TBinaryTree>::Search(const MeasurementVectorType & qp,
IndexArrayType & ind,
DistanceArrayType & dists)
{
/** Get k , dim and eps. */
int k = static_cast<int>(this->m_KNearestNeighbors);
int dim = static_cast<int>(this->m_DataDimension);
double eps = this->m_ErrorBound;
/** Allocate memory for ANN indices and distances arrays. */
ANNIndexArrayType ANNIndices;
ANNIndices = new ANNIndexType[k];
ANNDistanceArrayType ANNDistances;
ANNDistances = new ANNDistanceType[k];
/** Alocate memory for ANN query point and copy qp to it. */
ANNPointType ANNQueryPoint = annAllocPt(dim);
for (int i = 0; i < dim; ++i)
{
ANNQueryPoint[i] = qp[i];
}
/** The actual ANN search. */
// this->m_BinaryTree->GetANNTree()->annkSearch(
// ANNQueryPoint, k, ANNIndices, ANNDistances, eps );
this->m_BinaryTreeAsITKANNType->GetANNTree()->annkSearch(ANNQueryPoint, k, ANNIndices, ANNDistances, eps);
/** Set the ANNIndices and ANNDistances in the corresponding itk::Array's.
* Memory management is transfered to these itk::Array's, which have SmartPointers
* and therefore don't have to be regarded anymore. No deallocation of
* ANNIndices and ANNDistances is needed now.
*/
ind.SetData(ANNIndices, k, true);
dists.SetData(ANNDistances, k, true);
/** Deallocate the temporary ANNQueryPoint. */
annDeallocPt(ANNQueryPoint);
} // end Search
} // end namespace itk
#endif // end #ifndef itkANNStandardTreeSearch_hxx
|
