Problemadvanced
Euclidean shortest path in a polygon
Also called shortest path in polygon, geodesic path in polygon.
Shortest path between two points inside a simple polygon, measured in Euclidean length.
Shortest path between two points inside a simple polygon, measured in Euclidean length.
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 PHQ54T Edit this page History Report an error