/usr/include/ITK-4.9/itkQuadEdgeMeshFrontIterator.h is in libinsighttoolkit4-dev 4.9.0-4ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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 itkQuadEdgeMeshFrontIterator_h
#define itkQuadEdgeMeshFrontIterator_h
#include "itkMapContainer.h"
// -------------------------------------------------------------------------
#define itkQEDefineFrontIteratorMethodsMacro(MeshTypeArg) \
/* Dual definition placed before others because of .NET that cannot */ \
/* cope with definition of FrontIterator (that further hides the */ \
/* definition of the template). */ \
typedef typename MeshTypeArg::QEDual QEDualType; \
typedef typename MeshTypeArg::QEPrimal QEPrimalType; \
typedef QuadEdgeMeshFrontIterator< MeshTypeArg, \
QEDualType > FrontDualIterator; \
typedef QuadEdgeMeshConstFrontIterator< MeshTypeArg, \
QEDualType > \
ConstFrontDualIterator; \
typedef QuadEdgeMeshFrontIterator< MeshTypeArg, \
QEPrimalType > FrontIterator; \
typedef QuadEdgeMeshConstFrontIterator< MeshTypeArg, \
QEPrimalType > \
ConstFrontIterator; \
\
virtual FrontIterator BeginFront(QEPrimalType * seed = (QEPrimalType *)0) \
{ \
return ( FrontIterator(this, true, seed) ); \
} \
\
virtual ConstFrontIterator BeginFront(QEPrimalType * seed) const \
{ return ( ConstFrontIterator(this, true, seed) ); } \
\
virtual FrontIterator EndFront() \
{ \
return ( FrontIterator(this, false) ); \
} \
\
virtual ConstFrontIterator EndFront() const \
{ return ( ConstFrontIterator(this, false) ); } \
\
virtual FrontDualIterator BeginDualFront(QEDualType * seed = (QEDualType *)0) \
{ \
return ( FrontDualIterator(this, true, seed) ); \
} \
\
virtual ConstFrontDualIterator BeginDualFront(QEDualType * seed) const \
{ return ( ConstFrontDualIterator(this, true, seed) ); } \
\
virtual FrontDualIterator EndDualFront() \
{ \
return ( FrontDualIterator(this, false) ); \
} \
\
virtual ConstFrontDualIterator EndDualFront() const \
{ return ( ConstFrontDualIterator(this, false) ); }
namespace itk
{
/**
* \class QuadEdgeMeshFrontBaseIterator
*
* \brief Front iterator on Mesh class
*
* Like topological and geometrical operators, it iterates on edges.
* Unlike them, this iterator is not local, nor cyclic. Starting from a
* given seed, it will create a front that propagates on the surface.
* Depending on the weight associated which each edge, and on the type of the
* seed (primal or dual) it can be used for frint propagation algorithm,
* distance tree computation or other Djikstra like algorithms.
* \ingroup ITKQuadEdgeMesh
*/
template< typename TMesh, typename TQE >
class QuadEdgeMeshFrontBaseIterator
{
public:
// Hierarchy typedefs & values.
typedef QuadEdgeMeshFrontBaseIterator Self;
// Template types
typedef TMesh MeshType;
typedef TQE QEType;
protected:
// Mesh types
typedef typename MeshType::CoordRepType CoordRepType;
// QE types
typedef typename QEType::OriginRefType QEOriginType;
/**
* \class FrontAtom
*
* \brief Atomic information associated to each edge of the front.
*
* Note that when sorting this list, the sorting criteria is the
* Cost attribute.
* \ingroup ITKQuadEdgeMesh
*/
class FrontAtom
{
public:
FrontAtom(QEType *e = (QEType *)0, const CoordRepType c = 0):
m_Edge(e), m_Cost(c)
{}
virtual ~FrontAtom() {}
FrontAtom & operator=(const FrontAtom & r)
{ m_Edge = r.m_Edge; m_Cost = r.m_Cost; return *this; }
bool operator==(const FrontAtom & r) const
{ return ( m_Edge == r.m_Edge ); }
bool operator!=(const FrontAtom & r) const
{ return ( m_Edge != r.m_Edge ); }
bool operator<(const FrontAtom & r) const
{ return ( m_Cost < r.m_Cost ); }
public:
QEType * m_Edge;
CoordRepType m_Cost;
};
/** The active front is simply a list of edges that can be sorted on
* the sort attribute FrontAtom
*/
typedef std::list< FrontAtom > FrontType;
typedef typename FrontType::iterator FrontTypeIterator;
typedef FrontType * FrontTypePointer;
/** Whether an Origin (i.e. a vertex or a face since we either deal with
* primal or dual edges) was already visited.
*/
typedef MapContainer< QEOriginType, bool > IsVisitedContainerType;
typedef typename IsVisitedContainerType::Pointer IsVisitedPointerType;
public:
/** Object creation methods. */
QuadEdgeMeshFrontBaseIterator(MeshType *mesh = (MeshType *)0,
bool start = true,
QEType *seed = (QEType *)0);
virtual ~QuadEdgeMeshFrontBaseIterator();
Self & operator=(const Self & r)
{
if(this != &r)
{
m_Mesh = r.m_Mesh;
m_Start = r.m_Start;
m_Seed = r.m_Seed;
m_Front = r.m_Front;
m_IsPointVisited = r.m_IsPointVisited;
m_CurrentEdge = r.m_CurrentEdge;
}
return ( *this );
}
// Iteration methods.
bool operator==(Self & r)
{
return ( m_Start == r.m_Start );
}
bool operator==(const Self & r) const
{
return ( m_Start == r.m_Start );
}
bool operator!=(Self & r)
{
return ( !( this->operator==(r) ) );
}
bool operator!=(const Self & r) const
{
return ( !( this->operator==(r) ) );
}
Self & operator++();
Self & operator++(int) { return ( this->operator++() ); }
MeshType * GetMesh() const { return this->m_Mesh; }
protected:
/** Find a default seed by taking any edge (with proper type) in
* the current mesh.
*/
QEType * FindDefaultSeed();
/** The default cost associated to an edge is simply 1. This corresponds
* to the "topological metric" i.e. all edges have unit length.
*/
virtual CoordRepType GetCost(QEType *edge){ (void)edge; return ( 1 ); }
protected:
/** Mesh on which we propagate the front */
MeshType *m_Mesh;
/** Initial seed of the front */
QEType *m_Seed;
/** Whether the iterator is active */
bool m_Start;
/** The active front */
FrontTypePointer m_Front;
/** The already visited points */
IsVisitedPointerType m_IsPointVisited;
/** The current edge at this stage of iteration */
QEType *m_CurrentEdge;
};
/**
* \class QuadEdgeMeshFrontIterator
*
* \brief Non const quad edge front iterator.
* \ingroup ITKQuadEdgeMesh
*/
template< typename TMesh, typename TQE >
class QuadEdgeMeshFrontIterator:
public QuadEdgeMeshFrontBaseIterator< TMesh, TQE >
{
public:
/** Hierarchy typedefs and values. */
typedef QuadEdgeMeshFrontIterator Self;
typedef QuadEdgeMeshFrontBaseIterator< TMesh, TQE > Superclass;
typedef typename Superclass::MeshType MeshType;
typedef typename Superclass::QEType QEType;
public:
/** Object creation methods. */
QuadEdgeMeshFrontIterator(MeshType *mesh = (MeshType *)0,
bool start = true,
QEType *seed = (QEType *)0):
Superclass(mesh, start, seed) {}
virtual ~QuadEdgeMeshFrontIterator() {}
QEType * Value() { return ( this->m_CurrentEdge ); }
};
/**
* \class QuadEdgeMeshConstFrontIterator
*
* \brief Const quad edge mesh front iterator.
* \ingroup ITKQuadEdgeMesh
*/
template< typename TMesh, typename TQE = typename TMesh::QEType >
class QuadEdgeMeshConstFrontIterator:
public QuadEdgeMeshFrontBaseIterator< TMesh, TQE >
{
public:
/** Hierarchy typedefs & values. */
typedef QuadEdgeMeshConstFrontIterator Self;
typedef QuadEdgeMeshFrontBaseIterator< TMesh, TQE > Superclass;
typedef typename Superclass::QEType QEType;
typedef typename Superclass::MeshType MeshType;
typedef QuadEdgeMeshFrontIterator< MeshType, QEType > NoConstType;
public:
/** Object creation methods. */
QuadEdgeMeshConstFrontIterator(const MeshType *mesh = (MeshType *)0,
bool start = true,
QEType *seed = (QEType *)0)
{
(void)mesh;
(void)start;
(void)seed;
}
/** \todo do we need here a : Superclass( mesh, start, seed ) { } */
virtual ~QuadEdgeMeshConstFrontIterator() {}
Self & operator=(const NoConstType & r)
{
this->m_Mesh = r.GetMesh();
return ( *this );
}
const QEType * Value() const { return ( this->m_CurrentEdge ); }
};
}
#include "itkQuadEdgeMeshFrontIterator.hxx"
#endif
|