Data structureadvanced
Farthest-point Voronoi diagram
Also called farthest-site Voronoi diagram.
Voronoi diagram where each cell holds the points for which a given site is the farthest; its vertices form a tree.
Voronoi diagram where each cell holds the points for which a given site is the farthest; its vertices form a tree.
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 0J56YS Edit this page History Report an error