Represents an unoriented triangle as three vertices.
More...
#include <DGtal/topology/HalfEdgeDataStructure.h>
Represents an unoriented triangle as three vertices.
Definition at line 154 of file HalfEdgeDataStructure.h.
◆ Triangle() [1/2]
DGtal::HalfEdgeDataStructure::Triangle::Triangle |
( |
| ) |
|
|
inline |
Definition at line 168 of file HalfEdgeDataStructure.h.
169 {
170 v[0] =
v[1] =
v[2] = -1;
171 }
std::array< VertexIndex, 3 > v
The three vertex indices.
References v.
◆ Triangle() [2/2]
◆ i() [1/2]
VertexIndex & DGtal::HalfEdgeDataStructure::Triangle::i |
( |
| ) |
|
|
inline |
◆ i() [2/2]
const VertexIndex & DGtal::HalfEdgeDataStructure::Triangle::i |
( |
| ) |
const |
|
inline |
◆ j() [1/2]
VertexIndex & DGtal::HalfEdgeDataStructure::Triangle::j |
( |
| ) |
|
|
inline |
◆ j() [2/2]
const VertexIndex & DGtal::HalfEdgeDataStructure::Triangle::j |
( |
| ) |
const |
|
inline |
◆ k() [1/2]
VertexIndex & DGtal::HalfEdgeDataStructure::Triangle::k |
( |
| ) |
|
|
inline |
◆ k() [2/2]
const VertexIndex & DGtal::HalfEdgeDataStructure::Triangle::k |
( |
| ) |
const |
|
inline |
std::array<VertexIndex,3> DGtal::HalfEdgeDataStructure::Triangle::v |
The documentation for this struct was generated from the following file: