Problemcore
Convex decomposition of a polygon
Also called convex partition of polygon, convex polygon partition.
Partition a simple polygon into the fewest convex pieces; the optimal version is NP-hard for polygons with holes.
Partition a simple polygon into the fewest convex pieces; the optimal version is NP-hard for polygons with holes.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 3PK18N Edit this page History Report an error