Type Alias spade::handles::VertexHandle
source · pub type VertexHandle<'a, V, DE = (), UE = (), F = ()> = DynamicHandleImpl<'a, V, DE, UE, F, VertexTag, InnerTag>;
Expand description
Handle to a vertex of a triangulation.
Use this handle to retrieve the vertex position or its outgoing edges.
See also the handles module.
Aliased Type§
struct VertexHandle<'a, V, DE = (), UE = (), F = ()> { /* private fields */ }
Implementations§
source§impl<'a, V, DE, UE, F> VertexHandle<'a, V, DE, UE, F>where
V: HasPosition,
impl<'a, V, DE, UE, F> VertexHandle<'a, V, DE, UE, F>where
V: HasPosition,
source§impl<'a, V, DE, UE, F> VertexHandle<'a, V, DE, UE, F>
impl<'a, V, DE, UE, F> VertexHandle<'a, V, DE, UE, F>
sourcepub fn out_edges(
&self
) -> CircularIterator<'a, V, DE, UE, F, CCWEdgesNextBackFn>
pub fn out_edges( &self ) -> CircularIterator<'a, V, DE, UE, F, CCWEdgesNextBackFn>
Returns all directed edges going out of this vertex.
The edges are returned in counter clockwise order, beginning at an arbitrary edge.
A possible iteration order of v.out_edges()
Note: The returned iterator implements DoubleEndedIterator
, allowing traversal in
clockwise order.
sourcepub fn out_edge(&self) -> Option<DirectedEdgeHandle<'a, V, DE, UE, F>>
pub fn out_edge(&self) -> Option<DirectedEdgeHandle<'a, V, DE, UE, F>>
Returns an outgoing edge of this vertex.
If the vertex has multiple outgoing edges, any of them is returned.
sourcepub fn as_voronoi_face(&self) -> VoronoiFace<'a, V, DE, UE, F>
pub fn as_voronoi_face(&self) -> VoronoiFace<'a, V, DE, UE, F>
Returns the voronoi face that corresponds to this vertex of the Delaunay triangulation.