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

#include <itkQuadEdgeMeshFrontIterator.h>

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 which each edge, and on the type of the seed (primal or dual) it can be used for front propagation algorithm, distance tree computation or other Djikstra like algorithms.

Definition at line 75 of file itkQuadEdgeMeshFrontIterator.h.

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

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

Classes
class	FrontAtom

Public Types
using	MeshType = TMesh
using	QEType = TQE
using	Self = QuadEdgeMeshFrontBaseIterator

Protected Types
using	CoordinateType = typename MeshType::CoordinateType
using	QEOriginType = typename QEType::OriginRefType
using	FrontType = std::list<FrontAtom>
using	FrontTypeIterator = typename FrontType::iterator
using	FrontTypePointer = FrontType *
using	IsVisitedContainerType = MapContainer<QEOriginType, bool>
using	IsVisitedPointerType = typename IsVisitedContainerType::Pointer
MeshType *	m_Mesh {}
QEType *	m_Seed {}
bool	m_Start {}
FrontTypePointer	m_Front {}
IsVisitedPointerType	m_IsPointVisited {}
QEType *	m_CurrentEdge {}
	QuadEdgeMeshFrontBaseIterator (MeshType *mesh=nullptr, bool start=true, QEType *seed=nullptr)
virtual	~QuadEdgeMeshFrontBaseIterator ()
Self &	operator= (const Self &r)
bool	operator== (const Self &r) const
	ITK_UNEQUAL_OPERATOR_MEMBER_FUNCTION (Self)
Self &	operator++ ()
Self &	operator++ (int)
MeshType *	GetMesh () const
QEType *	FindDefaultSeed ()
virtual CoordinateType	GetCost (QEType *edge)

Member Typedef Documentation

CoordinateType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::CoordinateType = typename MeshType::CoordinateType

protected

Definition at line 87 of file itkQuadEdgeMeshFrontIterator.h.

FrontType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontType = std::list<FrontAtom>

protected

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.

FrontTypeIterator

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontTypeIterator = typename FrontType::iterator

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.

FrontTypePointer

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::FrontTypePointer = FrontType *

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.

IsVisitedContainerType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::IsVisitedContainerType = MapContainer<QEOriginType, bool>

protected

Whether an Origin (i.e. a vertex or a face since we either deal with primal or dual edges) was already visited.

Definition at line 149 of file itkQuadEdgeMeshFrontIterator.h.

IsVisitedPointerType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::IsVisitedPointerType = typename IsVisitedContainerType::Pointer

protected

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

Definition at line 150 of file itkQuadEdgeMeshFrontIterator.h.

MeshType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::MeshType = TMesh

Definition at line 82 of file itkQuadEdgeMeshFrontIterator.h.

QEOriginType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QEOriginType = typename QEType::OriginRefType

protected

Definition at line 93 of file itkQuadEdgeMeshFrontIterator.h.

QEType

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::QEType = TQE

Definition at line 83 of file itkQuadEdgeMeshFrontIterator.h.

Self

template<typename TMesh, typename TQE>

using itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::Self = QuadEdgeMeshFrontBaseIterator

Definition at line 79 of file itkQuadEdgeMeshFrontIterator.h.

Constructor & Destructor Documentation

QuadEdgeMeshFrontBaseIterator()

template<typename TMesh, typename TQE>

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

Object creation methods.

~QuadEdgeMeshFrontBaseIterator()

template<typename TMesh, typename TQE>

virtual itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::~QuadEdgeMeshFrontBaseIterator ( )

virtual

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

Member Function Documentation

FindDefaultSeed()

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.

GetCost()

template<typename TMesh, typename TQE>

virtual CoordinateType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::GetCost ( QEType * edge )

inlineprotectedvirtual

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 208 of file itkQuadEdgeMeshFrontIterator.h.

GetMesh()

template<typename TMesh, typename TQE>

MeshType * itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::GetMesh ( ) const

inline

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

Definition at line 192 of file itkQuadEdgeMeshFrontIterator.h.

References m_Mesh.

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

ITK_UNEQUAL_OPERATOR_MEMBER_FUNCTION()

template<typename TMesh, typename TQE>

itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::ITK_UNEQUAL_OPERATOR_MEMBER_FUNCTION

(

Self

)

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

operator++() [1/2]

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

operator++() [2/2]

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 186 of file itkQuadEdgeMeshFrontIterator.h.

operator=()

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 159 of file itkQuadEdgeMeshFrontIterator.h.

References m_CurrentEdge, m_Front, m_IsPointVisited, m_Mesh, m_Seed, and m_Start.

operator==()

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 175 of file itkQuadEdgeMeshFrontIterator.h.

References m_Start.

Member Data Documentation

m_CurrentEdge

template<typename TMesh, typename TQE>

QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_CurrentEdge {}

protected

The current edge at this stage of iteration

Definition at line 230 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by operator=(), and itk::QuadEdgeMeshFrontIterator< MeshType, QEType >::Value().

m_Front

template<typename TMesh, typename TQE>

FrontTypePointer itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Front {}

protected

The active front

Definition at line 224 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by operator=().

m_IsPointVisited

template<typename TMesh, typename TQE>

IsVisitedPointerType itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_IsPointVisited {}

protected

The already visited points

Definition at line 227 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by operator=().

m_Mesh

template<typename TMesh, typename TQE>

MeshType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Mesh {}

protected

Mesh on which we propagate the front

Definition at line 215 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by GetMesh(), and operator=().

m_Seed

template<typename TMesh, typename TQE>

QEType* itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Seed {}

protected

Initial seed of the front

Definition at line 218 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by operator=().

m_Start

template<typename TMesh, typename TQE>

bool itk::QuadEdgeMeshFrontBaseIterator< TMesh, TQE >::m_Start {}

protected

Whether the iterator is active

Definition at line 221 of file itkQuadEdgeMeshFrontIterator.h.

Referenced by operator=(), and operator==().

---

The documentation for this class was generated from the following file:

• itkQuadEdgeMeshFrontIterator.h