Algorithm Search⌘K

Data structureadvanced

Constrained Delaunay triangulation

Also called CDT.

Triangulation that contains prescribed segments while being Delaunay with respect to the visible points.

Triangulation that contains prescribed segments while being Delaunay with respect to the visible points.

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