Data structureresearch
Urquhart graph
Delaunay triangulation with the longest edge of every triangle removed; sits between the RNG and the Delaunay graph.
Delaunay triangulation with the longest edge of every triangle removed; sits between the RNG and the Delaunay graph.
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 XMCR03 Edit this page History Report an error