Class PolygonDecomposition

java.lang.Object
micycle.pgs.commons.PolygonDecomposition

public class PolygonDecomposition extends Object
Implementation of the Bayazit convex decomposition algorithm for simple polygons.

This algorithm is a O(nr) complexity algorithm where n is the number of input vertices and r is the number of output convex polygons. This algorithm can achieve optimal decompositions, however this is not guaranteed.

Version:
3.1.10
Author:
William Bittle
See Also:
  • Method Details

    • decompose

      public static List<org.locationtech.jts.geom.Polygon> decompose(org.locationtech.jts.geom.Polygon polygon)