Aleph::ConstrainedDelaunayTriangulation::Tri Struct Reference

Collaboration diagram for Aleph::ConstrainedDelaunayTriangulation::Tri:

Public Attributes
size_t	v [3]
	CCW vertex indices.
size_t	adj [3]
	adj[i] = neighbor across edge opposite v[i]
bool	constrained [3]
	constrained[i] = edge opp v[i] is constrained
bool	alive

Detailed Description

Definition at line 2917 of file geom_algorithms.H.

Member Data Documentation

adj

size_t Aleph::ConstrainedDelaunayTriangulation::Tri::adj[3]

adj[i] = neighbor across edge opposite v[i]

Definition at line 2920 of file geom_algorithms.H.

Referenced by Aleph::ConstrainedDelaunayTriangulation::adj_of().

alive

bool Aleph::ConstrainedDelaunayTriangulation::Tri::alive

Definition at line 2922 of file geom_algorithms.H.

constrained

bool Aleph::ConstrainedDelaunayTriangulation::Tri::constrained[3]

constrained[i] = edge opp v[i] is constrained

Definition at line 2921 of file geom_algorithms.H.

v

size_t Aleph::ConstrainedDelaunayTriangulation::Tri::v[3]

CCW vertex indices.

Definition at line 2919 of file geom_algorithms.H.

Referenced by Aleph::ConstrainedDelaunayTriangulation::edge_opposite(), and Aleph::ConstrainedDelaunayTriangulation::local_of().

---

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

• geom_algorithms.H