DGtal::HalfEdgeDataStructure::HalfEdge Struct Reference

#include <DGtal/topology/HalfEdgeDataStructure.h>

Public Member Functions
	HalfEdge ()
	Default constructor. The half-edge is invalid.

Data Fields
VertexIndex	toVertex
	The end vertex of this half-edge as an index into the vertex array.
FaceIndex	face
	Index into the face array.
EdgeIndex	edge
	Index into the edges array.
Index	opposite
	Index into the halfedges array.
Index	next
	Index into the halfedges array.

Detailed Description

The half edge structure. Each half-edge points to some Vertex, is incident to one face, lies on one undirected edge, has an opposite half-edge lying on the same edge, and has a next half-edge along the face.

Definition at line 188 of file HalfEdgeDataStructure.h.

Constructor & Destructor Documentation

HalfEdge()

DGtal::HalfEdgeDataStructure::HalfEdge::HalfEdge ( )

inline

Default constructor. The half-edge is invalid.

Definition at line 202 of file HalfEdgeDataStructure.h.

                 :
        toVertex( HALF_EDGE_INVALID_INDEX ),
        face( HALF_EDGE_INVALID_INDEX ),
        edge( HALF_EDGE_INVALID_INDEX ),
        opposite( HALF_EDGE_INVALID_INDEX ),
        next( HALF_EDGE_INVALID_INDEX )
      {}

References edge, face, DGtal::HALF_EDGE_INVALID_INDEX, next, opposite, and toVertex.

Field Documentation

edge

EdgeIndex DGtal::HalfEdgeDataStructure::HalfEdge::edge

Index into the edges array.

Definition at line 195 of file HalfEdgeDataStructure.h.

Referenced by HalfEdge(), DGtal::HalfEdgeDataStructure::isValid(), DGtal::HalfEdgeDataStructure::isValidTriangulation(), DGtal::HalfEdgeDataStructure::merge(), DGtal::HalfEdgeDataStructure::renumberEdge(), DGtal::HalfEdgeDataStructure::renumberHalfEdge(), and DGtal::HalfEdgeDataStructure::split().

face

FaceIndex DGtal::HalfEdgeDataStructure::HalfEdge::face

Index into the face array.

Definition at line 193 of file HalfEdgeDataStructure.h.

Referenced by DGtal::HalfEdgeDataStructure::boundaryArcs(), DGtal::HalfEdgeDataStructure::boundaryHalfEdgeIndices(), DGtal::HalfEdgeDataStructure::boundaryVertices(), DGtal::HalfEdgeDataStructure::flip(), DGtal::HalfEdgeDataStructure::getNeighboringFaces(), HalfEdge(), DGtal::HalfEdgeDataStructure::isFlippable(), DGtal::HalfEdgeDataStructure::isMergeable(), DGtal::HalfEdgeDataStructure::isValid(), DGtal::HalfEdgeDataStructure::isValidTriangulation(), DGtal::HalfEdgeDataStructure::isVertexBoundary(), DGtal::HalfEdgeDataStructure::merge(), DGtal::HalfEdgeDataStructure::renumberFace(), DGtal::HalfEdgeDataStructure::renumberHalfEdge(), and DGtal::HalfEdgeDataStructure::split().

next

Index DGtal::HalfEdgeDataStructure::HalfEdge::next

Index into the halfedges array.

Definition at line 199 of file HalfEdgeDataStructure.h.

Referenced by DGtal::HalfEdgeDataStructure::findHalfEdgeIndexFromArc(), DGtal::HalfEdgeDataStructure::flip(), DGtal::HalfEdgeDataStructure::getNeighboringFaces(), DGtal::HalfEdgeDataStructure::getNeighboringVertices(), HalfEdge(), DGtal::HalfEdgeDataStructure::isFlippable(), DGtal::HalfEdgeDataStructure::isMergeable(), DGtal::HalfEdgeDataStructure::isValid(), DGtal::HalfEdgeDataStructure::isValidTriangulation(), DGtal::HalfEdgeDataStructure::merge(), DGtal::HalfEdgeDataStructure::nbNeighboringVertices(), DGtal::HalfEdgeDataStructure::nbSides(), DGtal::HalfEdgeDataStructure::renumberFace(), DGtal::HalfEdgeDataStructure::renumberHalfEdge(), DGtal::HalfEdgeDataStructure::renumberVertex(), DGtal::HalfEdgeDataStructure::split(), and DGtal::HalfEdgeDataStructure::verticesOfFace().

opposite

Index DGtal::HalfEdgeDataStructure::HalfEdge::opposite

Index into the halfedges array.

Definition at line 197 of file HalfEdgeDataStructure.h.

Referenced by DGtal::HalfEdgeDataStructure::arcFromHalfEdgeIndex(), DGtal::HalfEdgeDataStructure::findHalfEdgeIndexFromArc(), DGtal::HalfEdgeDataStructure::flip(), DGtal::HalfEdgeDataStructure::getNeighboringFaces(), DGtal::HalfEdgeDataStructure::getNeighboringVertices(), HalfEdge(), DGtal::HalfEdgeDataStructure::isFlippable(), DGtal::HalfEdgeDataStructure::isMergeable(), DGtal::HalfEdgeDataStructure::isValid(), DGtal::HalfEdgeDataStructure::merge(), DGtal::HalfEdgeDataStructure::nbNeighboringVertices(), DGtal::HalfEdgeDataStructure::renumberEdge(), DGtal::HalfEdgeDataStructure::renumberHalfEdge(), DGtal::HalfEdgeDataStructure::renumberVertex(), and DGtal::HalfEdgeDataStructure::split().

toVertex

VertexIndex DGtal::HalfEdgeDataStructure::HalfEdge::toVertex

The end vertex of this half-edge as an index into the vertex array.

Definition at line 191 of file HalfEdgeDataStructure.h.

Referenced by DGtal::HalfEdgeDataStructure::arcFromHalfEdgeIndex(), DGtal::HalfEdgeDataStructure::boundaryVertices(), DGtal::HalfEdgeDataStructure::findHalfEdgeIndexFromArc(), DGtal::HalfEdgeDataStructure::flip(), DGtal::HalfEdgeDataStructure::getNeighboringVertices(), HalfEdge(), DGtal::HalfEdgeDataStructure::isFlippable(), DGtal::HalfEdgeDataStructure::isMergeable(), DGtal::HalfEdgeDataStructure::isValid(), DGtal::HalfEdgeDataStructure::isValidTriangulation(), DGtal::HalfEdgeDataStructure::merge(), DGtal::HalfEdgeDataStructure::renumberHalfEdge(), DGtal::HalfEdgeDataStructure::renumberVertex(), DGtal::HalfEdgeDataStructure::split(), and DGtal::HalfEdgeDataStructure::verticesOfFace().

---

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

• HalfEdgeDataStructure.h