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

#include <itkQuadEdgeMeshFrontIterator.h>

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

[legend]Collaboration diagram for itk::QuadEdgeMeshFrontIterator< TMesh, TQE >:

[legend]List of all members.

---

Detailed Description

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

Non const quad edge front iterator.

Definition at line 228 of file itkQuadEdgeMeshFrontIterator.h.

bool	operator!= (const Self &r) const
bool	operator!= (Self &r)
Self &	operator++ (int)
Self &	operator++ ()
bool	operator== (const Self &r) const
bool	operator== (Self &r)
typedef std::list< FrontAtom >	FrontType
typedef FrontType::iterator	FrontTypeIterator
typedef FrontType *	FrontTypePointer
typedef MapContainer< QEOriginType, bool >	IsVisitedContainerType
typedef IsVisitedContainerType::Pointer	IsVisitedPointerType
QEType *	m_CurrentEdge
FrontTypePointer	m_Front
IsVisitedPointerType	m_IsPointVisited
MeshType *	m_Mesh
QEType *	m_Seed
bool	m_Start
QEType *	FindDefaultSeed ()
virtual CoordRepType	GetCost (QEType *edge)
	QuadEdgeMeshFrontIterator (MeshType *mesh=(MeshType *) 0, bool start=true, QEType *seed=(QEType *) 0)
QEType *	Value ()
virtual	~QuadEdgeMeshFrontIterator ()
Public Types
typedef Superclass::MeshType	MeshType
typedef Superclass::QEType	QEType
typedef QuadEdgeMeshFrontIterator	Self
typedef QuadEdgeMeshFrontBaseIterator< TMesh, TQE >	Superclass
Protected Types
typedef MeshType::CoordRepType	CoordRepType
typedef QEType::OriginRefType	QEOriginType

---

Member Typedef Documentation

template<typename TMesh, typename TQE>

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

Definition at line 106 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>

typedef std::list< FrontAtom > itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontType [protected, inherited]

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, inherited]

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, inherited]

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, inherited]

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, inherited]

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 Superclass::MeshType itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::MeshType

Reimplemented from itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >.

Definition at line 236 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>

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

Definition at line 108 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>

typedef Superclass::QEType itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::QEType

Reimplemented from itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >.

Definition at line 237 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>

typedef QuadEdgeMeshFrontIterator itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::Self

Hierarchy typedefs and values.

Reimplemented from itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >.

Definition at line 234 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>

typedef QuadEdgeMeshFrontBaseIterator< TMesh, TQE > itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::Superclass

Definition at line 235 of file itkQuadEdgeMeshFrontIterator.h.

---

Constructor & Destructor Documentation

template<typename TMesh, typename TQE>

itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::QuadEdgeMeshFrontIterator	(	MeshType *	mesh = (MeshType*)0,
		bool	start = true,
		QEType *	seed = (QEType*)0
	)			[inline]

Object creation methods.

Definition at line 241 of file itkQuadEdgeMeshFrontIterator.h.

template<typename TMesh, typename TQE>

virtual itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::~QuadEdgeMeshFrontIterator

(

)

[inline, virtual]

Object creation methods.

Definition at line 245 of file itkQuadEdgeMeshFrontIterator.h.

---

Member Function Documentation

template<typename TMesh, typename TQE>

QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FindDefaultSeed

(

)

[protected, inherited]

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, inherited]

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, inherited]

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, inherited]

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, inherited]

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++

(

)

[inherited]

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

template<typename TMesh, typename TQE>

bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::operator==

(

const Self &

r

)

const [inline, inherited]

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, inherited]

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.

template<typename TMesh, typename TQE>

QEType* itk::QuadEdgeMeshFrontIterator< TMesh, TQE >::Value

(

void

)

[inline]

Object creation methods.

Definition at line 246 of file itkQuadEdgeMeshFrontIterator.h.

---

Member Data Documentation

template<typename TMesh, typename TQE>

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

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, inherited]

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, inherited]

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, inherited]

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, inherited]

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, inherited]

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:

• itkQuadEdgeMeshFrontIterator.h

---