Function parry2d::transformation::hertel_mehlhorn

pub fn hertel_mehlhorn(
    vertices: &[Point<Real>], 
    indices: &[[u32; 3]]
) -> Vec<Vec<Point<Real>>>

The Hertel-Mehlhorn algorithm.

Takes a set of triangles and returns a vector of convex polygons.

Time/Space complexity: O(n^2)/O(n) Where n is the number of points in the input polygon.

Quality of solution: This algorithm is a heuristic. At most four times the minimum number of convex polygons is created. However, in practice it works much better than that and often returns the optimal partitioning.

This algorithm is described in https://people.mpi-inf.mpg.de/~mehlhorn/ftp/FastTriangulation.pdf