Loading...
Searching...
No Matches
meshkit::BasicConstrainedDelaunay< Storage >::Triangle Struct Reference

One triangle slot of triangles(). More...

#include <meshkit/cdt.hpp>

Collaboration diagram for meshkit::BasicConstrainedDelaunay< Storage >::Triangle:

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.
 

Detailed Description

template<class Storage>
struct meshkit::BasicConstrainedDelaunay< Storage >::Triangle

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.

Member Data Documentation

◆ adj

template<class Storage>
int meshkit::BasicConstrainedDelaunay< Storage >::Triangle::adj[3]

Neighbour across the edge opposite v[i] (v[i+1], v[i+2]); -1 = none.

◆ alive

template<class Storage>
bool meshkit::BasicConstrainedDelaunay< Storage >::Triangle::alive

False once the slot is removed (removeExterior(), removeSuperTriangles(), region removal, vertex removal); readers must skip dead slots.

◆ constrained

template<class Storage>
bool meshkit::BasicConstrainedDelaunay< Storage >::Triangle::constrained[3]

Edge opposite v[i] is a constraint.

◆ v

template<class Storage>
int meshkit::BasicConstrainedDelaunay< Storage >::Triangle::v[3]

Counter-clockwise.


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