DGtal  1.5.beta
DGtal::HalfEdgeDataStructure::HalfEdge Struct Reference

#include <DGtal/topology/HalfEdgeDataStructure.h>

Public Member Functions

 HalfEdge ()
 Default constructor. The half-edge is invalid. More...
 

Data Fields

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

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.

202  :
208  {}
static std::size_t const HALF_EDGE_INVALID_INDEX
Index next
Index into the halfedges array.
EdgeIndex edge
Index into the edges array.
VertexIndex toVertex
The end vertex of this half-edge as an index into the vertex array.
Index opposite
Index into the halfedges array.
FaceIndex face
Index into the face array.

Field Documentation

◆ edge

◆ face

◆ next

◆ opposite

◆ toVertex


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