Theoremcore
Voronoi diagram complexity theorem
A Voronoi diagram of n sites has at most 2n-5 vertices and 3n-6 edges, so its size is O(n).
A Voronoi diagram of n sites has at most 2n-5 vertices and 3n-6 edges, so its size is O(n).
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 HT21YA Edit this page History Report an error