Function earclip_hashed

pub fn earclip_hashed<T>(
    poly: &Polygon<T>,
) -> impl Iterator<Item = (PointId, PointId, PointId)> + '_
where
    T: PolygonScalar + ZHashable,

$O(n)$ Polygon triangulation. Ears are selected in a pseudo-random manner.

$O(n^2)$ worst case complexity. Expected time is linear.