ITK
5.0.0
Insight Segmentation and Registration Toolkit
|
#include <itkQuadEdge.h>
Base class for the implementation of a quad-edge data structure as proposed in "Guibas and Stolfi 1985".
This implementation was contributed as a paper to the Insight Journal https://hdl.handle.net/1926/306
Definition at line 225 of file itkQuadEdge.h.
Public Types | |
using | ConstIterator = QuadEdgeMeshConstIterator< Self > |
using | Iterator = QuadEdgeMeshIterator< Self > |
using | Self = QuadEdge |
Public Member Functions | |
Self * | GetDnext () |
const Self * | GetDnext () const |
Self * | GetDprev () |
const Self * | GetDprev () const |
Self * | GetInvDnext () |
const Self * | GetInvDnext () const |
Self * | GetInvLnext () |
const Self * | GetInvLnext () const |
Self * | GetInvOnext () |
const Self * | GetInvOnext () const |
Self * | GetInvRnext () |
const Self * | GetInvRnext () const |
const Self * | GetInvRot () const |
Self * | GetLnext () |
const Self * | GetLnext () const |
Self * | GetLprev () |
const Self * | GetLprev () const |
Self * | GetOprev () |
const Self * | GetOprev () const |
unsigned int | GetOrder () const |
Self * | GetRnext () |
const Self * | GetRnext () const |
Self * | GetRprev () |
const Self * | GetRprev () const |
const Self * | GetSym () const |
bool | IsLnextGivenSizeCyclic (const int size) const |
itkQEDefineIteratorMethodsMacro (Onext) | |
QuadEdge () | |
QuadEdge (const QuadEdge &)=default | |
QuadEdge (QuadEdge &&)=default | |
QuadEdge & | operator= (const QuadEdge &)=default |
QuadEdge & | operator= (QuadEdge &&)=default |
virtual | ~QuadEdge () |
void | SetOnext (Self *onext) |
void | SetRot (Self *rot) |
Self * | GetOnext () |
Self * | GetRot () |
const Self * | GetOnext () const |
const Self * | GetRot () const |
void | Splice (Self *b) |
Self * | GetSym () |
Self * | GetInvRot () |
bool | IsHalfEdge () const |
bool | IsIsolated () const |
bool | IsEdgeInOnextRing (Self *testEdge) const |
Definition at line 233 of file itkQuadEdge.h.
using itk::QuadEdge::Iterator = QuadEdgeMeshIterator< Self > |
Iterator types.
Definition at line 232 of file itkQuadEdge.h.
using itk::QuadEdge::Self = QuadEdge |
Hierarchy type alias & values.
Definition at line 229 of file itkQuadEdge.h.
itk::QuadEdge::QuadEdge | ( | ) |
Object creation methods.
|
virtual |
Object creation methods.
Self* itk::QuadEdge::GetDnext | ( | ) |
Returns next edge with same right face and same Destination. The first edge encountered when moving counter-clockwise from e (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetDnext | ( | ) | const |
Self* itk::QuadEdge::GetDprev | ( | ) |
Returns the previous edge with same Right face and same Destination. The first edge encountered when moving clockwise from e around e->Dest. (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetDprev | ( | ) | const |
|
inline |
Definition at line 398 of file itkQuadEdge.h.
|
inline |
Definition at line 417 of file itkQuadEdge.h.
|
inline |
Definition at line 396 of file itkQuadEdge.h.
|
inline |
Definition at line 415 of file itkQuadEdge.h.
|
inline |
Definition at line 395 of file itkQuadEdge.h.
|
inline |
Definition at line 414 of file itkQuadEdge.h.
|
inline |
Definition at line 397 of file itkQuadEdge.h.
|
inline |
Definition at line 416 of file itkQuadEdge.h.
|
inline |
|
inline |
Definition at line 399 of file itkQuadEdge.h.
References GetRot().
Self* itk::QuadEdge::GetLnext | ( | ) |
Returns next edge with same Left face (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetLnext | ( | ) | const |
Self* itk::QuadEdge::GetLprev | ( | ) |
Returns previous edge with same Left face. The first edge encountered when moving clockwise from e around e->Left. (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetLprev | ( | ) | const |
|
inline |
Sub-algebra Get methods. Returns edge with same Origin (see "Accessing adjacent edges").
Definition at line 268 of file itkQuadEdge.h.
Referenced by Splice().
|
inline |
Sub-algebra Get methods. Returns edge with same Origin (see "Accessing adjacent edges").
Definition at line 270 of file itkQuadEdge.h.
Self* itk::QuadEdge::GetOprev | ( | ) |
Returns previous edge with same Origin (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetOprev | ( | ) | const |
unsigned int itk::QuadEdge::GetOrder | ( | ) | const |
Self* itk::QuadEdge::GetRnext | ( | ) |
Returns next edge with same Right face. The first edge encountered when moving counter-clockwise from e around e->Right. (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetRnext | ( | ) | const |
|
inline |
Sub-algebra Get methods. Returns edge with same Origin (see "Accessing adjacent edges").
Definition at line 269 of file itkQuadEdge.h.
Referenced by GetInvRot(), and Splice().
|
inline |
Sub-algebra Get methods. Returns edge with same Origin (see "Accessing adjacent edges").
Definition at line 271 of file itkQuadEdge.h.
Self* itk::QuadEdge::GetRprev | ( | ) |
Returns the previous edge with same Right face. The first edge encountered when moving clockwise from e around e->Right. (see "Accessing adjacent edges").
const Self* itk::QuadEdge::GetRprev | ( | ) | const |
|
inline |
Returns the symetric edge (see "Accessing adjacent edges").
Definition at line 312 of file itkQuadEdge.h.
|
inline |
Definition at line 322 of file itkQuadEdge.h.
bool itk::QuadEdge::IsEdgeInOnextRing | ( | Self * | testEdge | ) | const |
Queries.
|
inline |
Queries.
Definition at line 420 of file itkQuadEdge.h.
|
inline |
Queries.
Definition at line 421 of file itkQuadEdge.h.
bool itk::QuadEdge::IsLnextGivenSizeCyclic | ( | const int | size | ) | const |
|
inline |
Basic iterators methods.
|
inline |
|
inline |
Sub-algebra Set methods.
Definition at line 262 of file itkQuadEdge.h.
|
inline |
Basic quad-edge topological method.
This method describes all possible topological operations on an edge.
It is its own inverse. It works in two ways:
Definition at line 292 of file itkQuadEdge.h.
References GetOnext(), GetRot(), and SetOnext().