pub struct Edge<'m> { /* private fields */ }Expand description
An edge of a loop (EDGE_CURVE) — a curve bounded by two vertices.
Implementations§
Source§impl<'m> Edge<'m>
impl<'m> Edge<'m>
Sourcepub fn key(&self) -> EntityKey
pub fn key(&self) -> EntityKey
This edge’s global identity (a Copy key for maps / deduplication; a
shared edge reached from two faces yields the same key()).
pub fn start(&self) -> Option<Vertex<'m>>
pub fn end(&self) -> Option<Vertex<'m>>
Sourcepub fn same_sense(&self) -> bool
pub fn same_sense(&self) -> bool
Whether the edge’s start → end direction agrees with its curve’s
parameter direction (EDGE_CURVE same_sense). Edge::to_nurbs
already accounts for it; an importer consuming the exact curve via
Edge::curve composes it itself.
Sourcepub fn to_nurbs(&self) -> Option<NurbsCurve>
pub fn to_nurbs(&self) -> Option<NurbsCurve>
The NURBS (NurbsCurve) form of this
edge: its geometry bounded between the two vertex points, in the edge’s
direction (start → end). Contrast with Curve::to_nurbs, which
converts the whole curve — here an unbounded line becomes the finite
segment, a circle the arc between the vertices, and an edge whose
vertices coincide (a closed edge) the whole closed curve.