Main Page   Groups   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members   Concepts

itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE > Class Template Reference

#include <itkQuadEdgeMeshFrontIterator.h>

Inheritance diagram for itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >:

Inheritance graph
[legend]
Collaboration diagram for itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >:

Collaboration graph
[legend]
List of all members.

Detailed Description

template<typename TMesh, typename TQE>
class itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >

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 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 94 of file itkQuadEdgeMeshFrontIterator.h.
typedef std::list< FrontAtomFrontType
typedef FrontType::iterator FrontTypeIterator
typedef FrontTypeFrontTypePointer
typedef MapContainer< QEOriginType,
bool > 
IsVisitedContainerType
typedef IsVisitedContainerType::Pointer IsVisitedPointerType
QETypem_CurrentEdge
FrontTypePointer m_Front
IsVisitedPointerType m_IsPointVisited
MeshTypem_Mesh
QETypem_Seed
bool m_Start
bool operator!= (const Self &r) const
bool operator!= (Self &r)
Selfoperator++ (int)
Selfoperator++ ()
Selfoperator= (const Self &r)
bool operator== (const Self &r) const
bool operator== (Self &r)
 QuadEdgeMeshFrontBaseIterator (MeshType *mesh=(MeshType *) 0, bool start=true, QEType *seed=(QEType *) 0)
virtual ~QuadEdgeMeshFrontBaseIterator ()
QETypeFindDefaultSeed ()
virtual CoordRepType GetCost (QEType *edge)

Public Types

typedef TMesh MeshType
typedef TQE QEType
typedef QuadEdgeMeshFrontBaseIterator Self

Protected Types

typedef MeshType::CoordRepType CoordRepType
typedef QEType::OriginRefType QEOriginType

Classes

class  FrontAtom
 Atomic information associated to each edge of the front. More...


Member Typedef Documentation

template<typename TMesh, typename TQE>
typedef MeshType::CoordRepType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::CoordRepType [protected]

Definition at line 106 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 143 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 144 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 145 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 150 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 151 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
typedef TMesh itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::MeshType

Reimplemented in itk::QuadEdgeMeshFrontIterator< TMesh, TQE >, and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >.

Definition at line 101 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
typedef QEType::OriginRefType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QEOriginType [protected]

Definition at line 108 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
typedef TQE itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QEType

Reimplemented in itk::QuadEdgeMeshFrontIterator< TMesh, TQE >, and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >.

Definition at line 102 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
typedef QuadEdgeMeshFrontBaseIterator itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::Self

Reimplemented in itk::QuadEdgeMeshFrontIterator< TMesh, TQE >, and itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >.

Definition at line 98 of file itkQuadEdgeMeshFrontIterator.h.


Constructor & Destructor Documentation

template<typename TMesh, typename TQE>
itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QuadEdgeMeshFrontBaseIterator ( MeshType mesh = (MeshType *) 0,
bool  start = true,
QEType seed = (QEType *) 0 
)

Object creation methods.

template<typename TMesh, typename TQE>
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 158 of file itkQuadEdgeMeshFrontIterator.h.


Member Function Documentation

template<typename TMesh, typename TQE>
QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FindDefaultSeed (  )  [protected]

Find a default seed by taking any edge (with proper type) in the current mesh.

template<typename TMesh, typename TQE>
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 205 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 187 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 182 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
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 194 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>
Self& itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator++ (  ) 

The active front is simply a list of edges that can be sorted on the sort attribute FrontAtom

template<typename TMesh, typename TQE>
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 160 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.

template<typename TMesh, typename TQE>
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 177 of file itkQuadEdgeMeshFrontIterator.h.

References itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start.

template<typename TMesh, typename TQE>
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 172 of file itkQuadEdgeMeshFrontIterator.h.

References itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start.


Member Data Documentation

template<typename TMesh, typename TQE>
QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_CurrentEdge [protected]

The current edge at this stage of iteration.

Definition at line 219 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().

template<typename TMesh, typename TQE>
FrontTypePointer itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Front [protected]

The active front.

Definition at line 215 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().

template<typename TMesh, typename TQE>
IsVisitedPointerType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_IsPointVisited [protected]

The already visited points.

Definition at line 217 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().

template<typename TMesh, typename TQE>
MeshType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Mesh [protected]

Mesh on which we propagate the front.

Definition at line 209 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by itk::QuadEdgeMeshConstFrontIterator< TMesh, TQE >::operator=(), and itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().

template<typename TMesh, typename TQE>
QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Seed [protected]

Initial seed of the front.

Definition at line 211 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=().

template<typename TMesh, typename TQE>
bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start [protected]

Whether the iterator is active.

Definition at line 213 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator=(), and itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator==().


The documentation for this class was generated from the following file:
Generated at Wed Jul 30 08:59:33 2008 for ITK by doxygen 1.5.1 written by Dimitri van Heesch, © 1997-2000