pub fn segment_intersections<'a, Edge, T: 'a>(
    edges: &'a [Edge]
) -> impl Iterator<Item = (&'_ Edge, &'_ Edge)> where
    &'a Edge: Into<LineSegmentView<'a, T, 2>>,
    T: PolygonScalar
Expand description

Find all line segment intersections.

Time complexity

$O(n^2)$