|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Collect edges that cross segment (u,v) by scanning all mesh edges. More...
Public Attributes | |
| size_t | tri |
| size_t | local |
| local index in tri (opposite vertex) | |
Collect edges that cross segment (u,v) by scanning all mesh edges.
Returns pairs of (tri_index, local_edge_index) for each crossing.
Definition at line 3218 of file geom_algorithms.H.
| size_t Aleph::ConstrainedDelaunayTriangulation::CrossingEdge::local |
local index in tri (opposite vertex)
Definition at line 3221 of file geom_algorithms.H.
| size_t Aleph::ConstrainedDelaunayTriangulation::CrossingEdge::tri |
Definition at line 3220 of file geom_algorithms.H.