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
|
/*=========================================================================
*
* 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 itkANNPriorityTreeSearch_h
#define itkANNPriorityTreeSearch_h
#include "itkBinaryANNTreeSearchBase.h"
namespace itk
{
/**
* \class ANNPriorityTreeSearch
*
* \brief
*
*
* \ingroup ANNwrap
*/
template <class TListSample>
class ITK_TEMPLATE_EXPORT ANNPriorityTreeSearch : public BinaryANNTreeSearchBase<TListSample>
{
public:
ITK_DISALLOW_COPY_AND_MOVE(ANNPriorityTreeSearch);
/** Standard itk. */
using Self = ANNPriorityTreeSearch;
using Superclass = BinaryANNTreeSearchBase<TListSample>;
using Pointer = SmartPointer<Self>;
using ConstPointer = SmartPointer<const Self>;
/** New method for creating an object using a factory. */
itkNewMacro(Self);
/** ITK type info. */
itkTypeMacro(ANNPriorityTreeSearch, BinaryANNTreeSearchBase);
/** Typedef's from Superclass. */
using typename Superclass::ListSampleType;
using typename Superclass::BinaryTreeType;
using typename Superclass::MeasurementVectorType;
using typename Superclass::IndexArrayType;
using typename Superclass::DistanceArrayType;
using typename Superclass::ANNPointType; // double *
using typename Superclass::ANNIndexType; // int
using typename Superclass::ANNIndexArrayType; // int *
using typename Superclass::ANNDistanceType; // double
using typename Superclass::ANNDistanceArrayType; // double *
using typename Superclass::BinaryANNTreeType;
/** Typedefs for casting to kd tree. */
using ANNkDTreeType = ANNkd_tree;
using ANNPointSetType = ANNpointSet;
/** Set and get the error bound eps. */
itkSetClampMacro(ErrorBound, double, 0.0, 1e14);
itkGetConstMacro(ErrorBound, double);
/** Search the nearest neighbours of a query point qp. */
void
Search(const MeasurementVectorType & qp, IndexArrayType & ind, DistanceArrayType & dists) override;
void
SetBinaryTree(BinaryTreeType * tree) override;
protected:
ANNPriorityTreeSearch();
~ANNPriorityTreeSearch() override = default;
/** Member variables. */
double m_ErrorBound{};
ANNkDTreeType * m_BinaryTreeAskDTree{};
};
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
# include "itkANNPriorityTreeSearch.hxx"
#endif
#endif // end #ifndef itkANNPriorityTreeSearch_h
|
