pub type EdgeChords = HashMap<u32, f64>;Expand description
The rings bounding a face in parameter space, and whether every boundary
edge met its deflection.
Boundary rings with, per ring vertex, the 3D anchor its edge’s own curve
provides; None where an edge has no 3D curve to defer to.
The chord each edge must be drawn with, where the caller’s is too coarse.
Keyed by the edge’s node, so both faces bounding it look the same value up and sample it identically. Absent means the caller’s own chord. The chord each edge is to be drawn to, by edge node index, where a face wants its edges finer than the caller’s chord: what every face sharing an edge has to agree on, or their meshes disagree along it.
Aliased Type§
pub struct EdgeChords { /* private fields */ }