#include <itkQuadEdgeMeshFrontIterator.h>
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 wich 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.
Definition at line 78 of file itkQuadEdgeMeshFrontIterator.h.
typedef MeshType::CoordRepType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::CoordRepType [protected] |
Definition at line 90 of file itkQuadEdgeMeshFrontIterator.h.
typedef std::list< FrontAtom > itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontType [protected] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 127 of file itkQuadEdgeMeshFrontIterator.h.
typedef FrontType::iterator itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontTypeIterator [protected] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 128 of file itkQuadEdgeMeshFrontIterator.h.
typedef FrontType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontTypePointer [protected] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 129 of file itkQuadEdgeMeshFrontIterator.h.
typedef MapContainer< QEOriginType, bool > itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::IsVisitedContainerType [protected] |
Whether an Origin (i.e. a vertex or a face since we either deal with primal or dual edges) was allready visited.
Definition at line 134 of file itkQuadEdgeMeshFrontIterator.h.
typedef IsVisitedContainerType::Pointer itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::IsVisitedPointerType [protected] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 135 of file itkQuadEdgeMeshFrontIterator.h.
typedef TMesh itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::MeshType |
Reimplemented in itk::QuadEdgeMeshFrontIterator< TMesh, TQE >, and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >.
Definition at line 85 of file itkQuadEdgeMeshFrontIterator.h.
typedef QEType::OriginRefType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QEOriginType [protected] |
Definition at line 92 of file itkQuadEdgeMeshFrontIterator.h.
typedef TQE itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QEType |
Reimplemented in itk::QuadEdgeMeshFrontIterator< TMesh, TQE >, and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >.
Definition at line 86 of file itkQuadEdgeMeshFrontIterator.h.
typedef QuadEdgeMeshFrontBaseIterator itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::Self |
Reimplemented in itk::QuadEdgeMeshFrontIterator< TMesh, TQE >, and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >.
Definition at line 82 of file itkQuadEdgeMeshFrontIterator.h.
itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QuadEdgeMeshFrontBaseIterator | ( | MeshType * | mesh = (MeshType *) 0 , |
|
bool | start = true , |
|||
QEType * | seed = (QEType *) 0 | |||
) |
Object creation methods.
virtual itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::~QuadEdgeMeshFrontBaseIterator | ( | ) | [inline, virtual] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 142 of file itkQuadEdgeMeshFrontIterator.h.
QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FindDefaultSeed | ( | ) | [protected] |
Find a default seed by taking any edge (with proper type) in the current mesh.
virtual CoordRepType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::GetCost | ( | QEType * | edge | ) | [inline, protected, virtual] |
The default cost associated to an edge is simply 1. This corresponds to the "topological metric" i.e. all edges have unit length.
Definition at line 189 of file itkQuadEdgeMeshFrontIterator.h.
bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator!= | ( | const Self & | r | ) | const [inline] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 171 of file itkQuadEdgeMeshFrontIterator.h.
bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator!= | ( | Self & | r | ) | [inline] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 166 of file itkQuadEdgeMeshFrontIterator.h.
Self& itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator++ | ( | int | ) | [inline] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 178 of file itkQuadEdgeMeshFrontIterator.h.
Self& itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator++ | ( | ) |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Self& itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator= | ( | const Self & | r | ) | [inline] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 144 of file itkQuadEdgeMeshFrontIterator.h.
References itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_CurrentEdge, itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Front, itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_IsPointVisited, itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Mesh, itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Seed, and itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start.
bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator== | ( | const Self & | r | ) | const [inline] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 161 of file itkQuadEdgeMeshFrontIterator.h.
References itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start.
bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator== | ( | Self & | r | ) | [inline] |
The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom
Definition at line 156 of file itkQuadEdgeMeshFrontIterator.h.
References itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start.
QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_CurrentEdge [protected] |
The current edge at this stage of iteration.
Definition at line 203 of file itkQuadEdgeMeshFrontIterator.h.
Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=(), itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >::Value(), and itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::Value().
FrontTypePointer itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Front [protected] |
The active front.
Definition at line 199 of file itkQuadEdgeMeshFrontIterator.h.
Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().
IsVisitedPointerType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_IsPointVisited [protected] |
The already visited points.
Definition at line 201 of file itkQuadEdgeMeshFrontIterator.h.
Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().
MeshType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Mesh [protected] |
Mesh on which we propagate the front.
Definition at line 193 of file itkQuadEdgeMeshFrontIterator.h.
Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=(), and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >::operator=().
QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Seed [protected] |
Initial seed of the front.
Definition at line 195 of file itkQuadEdgeMeshFrontIterator.h.
Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().
bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start [protected] |
Whether the iterator is active.
Definition at line 197 of file itkQuadEdgeMeshFrontIterator.h.
Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=(), and itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator==().