|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Public Attributes | |
| size_t | v [3] |
| vertex indices, CCW order | |
| size_t | adj [3] |
| adj[i] = neighbor across edge opposite v[i] | |
| bool | alive |
Definition at line 2522 of file geom_algorithms.H.
| size_t Aleph::DelaunayTriangulationRandomizedIncremental::Tri::adj[3] |
adj[i] = neighbor across edge opposite v[i]
Definition at line 2525 of file geom_algorithms.H.
Referenced by Aleph::DelaunayTriangulationRandomizedIncremental::adj_of().
| bool Aleph::DelaunayTriangulationRandomizedIncremental::Tri::alive |
Definition at line 2526 of file geom_algorithms.H.
| size_t Aleph::DelaunayTriangulationRandomizedIncremental::Tri::v[3] |
vertex indices, CCW order
Definition at line 2524 of file geom_algorithms.H.
Referenced by Aleph::DelaunayTriangulationRandomizedIncremental::local_of(), and Aleph::DelaunayTriangulationRandomizedIncremental::point_in_tri().