public class EarClipping extends Object implements Decomposer, TriangulatorImplementation of the Ear Clipping convex decomposition algorithm for simple polygons.
This algorithm operates only on simple polygons. A simple polygon is a polygon that has vertices that are connected by edges where:
- Edges can only intersect at vertices
- Vertices have at most two edge connections
This implementation does not handle polygons with holes, but accepts both counter-clockwise and clockwise polygons.
The polygon to decompose must be 4 or more vertices.
This algorithm creates a valid triangulation (N - 2) triangles, then employs the Hertel-Mehlhorn algorithm to reduce the number of convex pieces.
This algorithm is O(n2).
- William Bittle
Constructors Constructor Description
All Methods Instance Methods Concrete Methods Modifier and Type Method Description
decompose(Vector2... points)Performs the decomposition on the given polygon returning a list of
triangulate(Vector2... points)Performs the triangulation on the given polygon returning a list of
decomposeDescription copied from interface:
DecomposerPerforms the decomposition on the given polygon returning a list of
triangulateDescription copied from interface:
TriangulatorPerforms the triangulation on the given polygon returning a list of