Algorithmcore
Half-plane intersection by sorting and deque
Also called sort-and-deque-half-plane-intersection.
Sort half-planes by angle, then use a deque to build the convex intersection in O(n log n) time.
Sort half-planes by angle, then use a deque to build the convex intersection in O(n log n) time.
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 EFZJWK Edit this page History Report an error