One triangle slot of triangles(). More...
#include <meshkit/cdt.hpp>
Public Attributes | |
| int | v [3] |
| Counter-clockwise. | |
| int | adj [3] |
| Neighbour across the edge opposite v[i] (v[i+1], v[i+2]); -1 = none. | |
| bool | constrained [3] |
| Edge opposite v[i] is a constraint. | |
| bool | alive |
| False once the slot is removed (removeExterior(), removeSuperTriangles(), region removal, vertex removal); readers must skip dead slots. | |
One triangle slot of triangles().
Indices in v and adj refer to vertices() and triangles() respectively. Until the next build(), removed triangles stay as dead slots.
| int meshkit::BasicConstrainedDelaunay< Storage >::Triangle::adj[3] |
Neighbour across the edge opposite v[i] (v[i+1], v[i+2]); -1 = none.
| bool meshkit::BasicConstrainedDelaunay< Storage >::Triangle::alive |
False once the slot is removed (removeExterior(), removeSuperTriangles(), region removal, vertex removal); readers must skip dead slots.
| bool meshkit::BasicConstrainedDelaunay< Storage >::Triangle::constrained[3] |
Edge opposite v[i] is a constraint.
| int meshkit::BasicConstrainedDelaunay< Storage >::Triangle::v[3] |
Counter-clockwise.