Expand description
Computational geometry functions, for example finding convex hulls.
Functions
Approximates a polygon using the Douglas–Peucker algorithm.
Computes the length of an arc. If closed is set to true then the distance
between the last and the first point is included in the total length.
Finds the convex hull of a set of points, using the Graham scan algorithm.
Finds the rectangle of least area that includes all input points. This rectangle need not be axis-aligned.