Mark Bayazit's algorithm for concave polygon decomposition https://mpen.ca/406/bayazit
static void wblut.geom.WB_PolygonDecomposer.decomposePolygon |
( |
final List< WB_Point > |
pointlist, |
|
|
final List< WB_Polygon > |
accumulator |
|
) |
| |
|
staticprivate |
Decompose the given polygon into a reasonably small number of convex polygons. Additional points can be introduced by the algorithm. There is no guarantee that the number of polygons is optimal.
- Parameters
-
- Returns
- List<WB_Polygon>
static boolean wblut.geom.WB_PolygonDecomposer.isVisible |
( |
final List< WB_Point > |
pointlist, |
|
|
final int |
i, |
|
|
final int |
j |
|
) |
| |
|
staticprivate |
The documentation for this class was generated from the following file: