Problemintro
Convex hull problem
Also called 2D convex hull, computing the convex hull.
Given n points in the plane, output the vertices of their convex hull in order.
Given n points in the plane, output the vertices of their convex hull in order.
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 NP0Q33 Edit this page History Report an error