Function graph_algo_ptas::algorithm::triangulation::triangulate

source · [−]

pub fn triangulate(
    graph: &impl GraphDCEL<LinkVertex, LinkDart, LinkFace, LinkGraphIter<LinkVertex>, LinkGraphIter<LinkDart>, LinkGraphIter<LinkFace>>
) -> HashSet<(LinkVertex, LinkVertex)>

Expand description

Returns the edges of a graph that need to be added to be fully triangulated. The graph needs to be connected.