Theoremintro
Triangulation counting theorem
Also called Euler counting for triangulations.
A triangulation of n points with h hull vertices has 2n-2-h triangles and 3n-3-h edges.
A triangulation of n points with h hull vertices has 2n-2-h triangles and 3n-3-h edges.
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 680M9T Edit this page History Report an error