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 totrue
then the distance between the last and the first point is included in the total length. - Calculates the area of the contour using the shoelace formula. The returned value is always non-negative.
- 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.
- Calculates the oriented area of the contour using the shoelace formula. The returned value may be negative depending on the contour orientation (clockwise or counter-clockwise).