go home Home | Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Data Structures | File List | Namespace Members | Data Fields | Globals | Related Pages
itkANNPriorityTreeSearch.h
Go to the documentation of this file.
1 /*=========================================================================
2  *
3  * Copyright UMC Utrecht and contributors
4  *
5  * Licensed under the Apache License, Version 2.0 (the "License");
6  * you may not use this file except in compliance with the License.
7  * You may obtain a copy of the License at
8  *
9  * http://www.apache.org/licenses/LICENSE-2.0.txt
10  *
11  * Unless required by applicable law or agreed to in writing, software
12  * distributed under the License is distributed on an "AS IS" BASIS,
13  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14  * See the License for the specific language governing permissions and
15  * limitations under the License.
16  *
17  *=========================================================================*/
18 #ifndef __itkANNPriorityTreeSearch_h
19 #define __itkANNPriorityTreeSearch_h
20 
22 
23 namespace itk
24 {
25 
35 template< class TListSample >
36 class ANNPriorityTreeSearch : public BinaryANNTreeSearchBase< TListSample >
37 {
38 public:
39 
44  typedef SmartPointer< const Self > ConstPointer;
45 
47  itkNewMacro( Self );
48 
51 
58 
59  typedef typename Superclass::ANNPointType ANNPointType; // double *
60  typedef typename Superclass::ANNIndexType ANNIndexType; // int
62  typedef typename Superclass::ANNDistanceType ANNDistanceType; // double
64 
66 
68  typedef ANNkd_tree ANNkDTreeType;
69  typedef ANNpointSet ANNPointSetType;
70 
72  itkSetClampMacro( ErrorBound, double, 0.0, 1e14 );
73  itkGetConstMacro( ErrorBound, double );
74 
76  virtual void Search( const MeasurementVectorType & qp, IndexArrayType & ind,
77  DistanceArrayType & dists );
78 
79  virtual void SetBinaryTree( BinaryTreeType * tree );
80 
81 protected:
82 
84  virtual ~ANNPriorityTreeSearch();
85 
87  double m_ErrorBound;
88  ANNkDTreeType * m_BinaryTreeAskDTree;
89 
90 private:
91 
92  ANNPriorityTreeSearch( const Self & ); // purposely not implemented
93  void operator=( const Self & ); // purposely not implemented
94 
95 };
96 
97 } // end namespace itk
98 
99 #ifndef ITK_MANUAL_INSTANTIATION
100 #include "itkANNPriorityTreeSearch.hxx"
101 #endif
102 
103 #endif // end #ifndef __itkANNPriorityTreeSearch_h
SmartPointer< const Self > ConstPointer
Superclass::ListSampleType ListSampleType
Superclass::MeasurementVectorType MeasurementVectorType
Superclass::BinaryTreeType BinaryTreeType
Superclass::BinaryANNTreeType BinaryANNTreeType
BinaryANNTreeSearchBase< TListSample > Superclass
void operator=(const Self &)
Superclass::IndexArrayType IndexArrayType
Superclass::ANNDistanceArrayType ANNDistanceArrayType
Superclass::MeasurementVectorType MeasurementVectorType
Superclass::ANNIndexArrayType ANNIndexArrayType
Superclass::DistanceArrayType DistanceArrayType
virtual void SetBinaryTree(BinaryTreeType *tree)
Superclass::ANNPointType ANNPointType
Superclass::IndexArrayType IndexArrayType
Superclass::ListSampleType ListSampleType
virtual void Search(const MeasurementVectorType &qp, IndexArrayType &ind, DistanceArrayType &dists)
Superclass::ANNDistanceType ANNDistanceType
Superclass::DistanceArrayType DistanceArrayType
Superclass::ANNIndexType ANNIndexType


Generated on 04-09-2015 for elastix by doxygen 1.8.9.1 elastix logo