Algorithmadvanced
Schnyder drawing algorithm
Also called Schnyder's drawing.
Straight-line grid drawing of a planar graph on an (n-2) by (n-2) grid using Schnyder woods.
Straight-line grid drawing of a planar graph on an (n-2) by (n-2) grid using Schnyder woods.
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 EKZ3MZ Edit this page History Report an error