decomposes the polygon poly into a disjoint union of simpler polygons.
decomposes into polygons of the specified "type".
- PolygonDecomposition is also known as tessellation, triangulation or partition.
- PolygonDecomposition is typically used to represent a polygon as a union of simpler objects for which a problem may be easier to solve.
- PolygonDecomposition gives a Polygon consisting of a union of polygons with disjoint interiors, but boundaries may overlap.
- Possible "type" specifications:
"Simple" simple polygons "Convex" convex polygons "Triangle" triangles
Examplesopen allclose all
Basic Examples (2)
Decompose a Polygon into a union of simpler polygons:
Basic Uses (5)
Decompose into polygons of a specific type:
PolygonDecomposition works on polygonal regions:
PolygonDecomposition works on polygons with GeoPosition:
Polygons with GeoGridPosition:
Convex Decomposition (4)
Properties & Relations (2)
Use SimplePolygonQ to test whether a polygon is simple:
Decompose into simple polygons:
Use ConvexPolygonQ to test whether a polygon is convex:
Wolfram Research (2019), PolygonDecomposition, Wolfram Language function, https://reference.wolfram.com/language/ref/PolygonDecomposition.html.
Wolfram Language. 2019. "PolygonDecomposition." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/PolygonDecomposition.html.
Wolfram Language. (2019). PolygonDecomposition. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/PolygonDecomposition.html