Problemintro
Polygon triangulation
Also called Triangulating a simple polygon, triangulating a polygon, triangulation of a simple polygon.
Partition a simple polygon into n-2 triangles by non-crossing diagonals.
Partition a simple polygon into n-2 triangles by non-crossing diagonals.
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 2N7KHY Edit this page History Report an error