Algorithm Search⌘K

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.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • The abstract type
  • one source with a locator