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
|
/*=========================================================================
*
* 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 itkBinaryTreeSearchBase_h
#define itkBinaryTreeSearchBase_h
#include "itkObject.h"
#include "itkArray.h"
#include "itkBinaryTreeBase.h"
namespace itk
{
/**
* \class BinaryTreeSearchBase
*
* \brief
*
*
* \ingroup ANNwrap
*/
template <class TListSample>
class ITK_TEMPLATE_EXPORT BinaryTreeSearchBase : public Object
{
public:
ITK_DISALLOW_COPY_AND_MOVE(BinaryTreeSearchBase);
/** Standard itk. */
using Self = BinaryTreeSearchBase;
using Superclass = Object;
using Pointer = SmartPointer<Self>;
using ConstPointer = SmartPointer<const Self>;
/** ITK type info. */
itkTypeMacro(BinaryTreeSearchBase, Object);
/** Typedef's. */
using ListSampleType = TListSample;
using BinaryTreeType = BinaryTreeBase<ListSampleType>;
using BinaryTreePointer = typename BinaryTreeType::Pointer;
using MeasurementVectorType = typename BinaryTreeType::MeasurementVectorType;
using IndexArrayType = Array<int>;
using DistanceArrayType = Array<double>;
/** Set and get the binary tree. */
virtual void
SetBinaryTree(BinaryTreeType * tree);
const BinaryTreeType *
GetBinaryTree() const;
/** Set and get the number of nearest neighbours k. */
itkSetMacro(KNearestNeighbors, unsigned int);
itkGetConstMacro(KNearestNeighbors, unsigned int);
/** Search the nearest neighbours of a query point qp. */
virtual void
Search(const MeasurementVectorType & qp, IndexArrayType & ind, DistanceArrayType & dists) = 0;
protected:
BinaryTreeSearchBase();
~BinaryTreeSearchBase() override = default;
/** Member variables. */
BinaryTreePointer m_BinaryTree{};
unsigned int m_KNearestNeighbors{};
unsigned int m_DataDimension{};
};
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
# include "itkBinaryTreeSearchBase.hxx"
#endif
#endif // end #ifndef itkBinaryTreeSearchBase_h
|
