Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::DelaunayTriangulationRandomizedIncremental::Tri Struct Reference
Collaboration diagram for Aleph::DelaunayTriangulationRandomizedIncremental::Tri:
[legend]

Public Attributes

size_t v [3]
 vertex indices, CCW order
 
size_t adj [3]
 adj[i] = neighbor across edge opposite v[i]
 
bool alive
 

Detailed Description

Definition at line 2522 of file geom_algorithms.H.

Member Data Documentation

◆ adj

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().

◆ alive

bool Aleph::DelaunayTriangulationRandomizedIncremental::Tri::alive

Definition at line 2526 of file geom_algorithms.H.

◆ v

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

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