Problemcore
Planar point location in O(log n)
Also called Point location in O(log n).
Problem of finding which region of a planar subdivision contains a query point, solved in logarithmic time with a sweep and persistent or ordered structures.
Problem of finding which region of a planar subdivision contains a query point, solved in logarithmic time with a sweep and persistent or ordered structures.
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 FK22GB Edit this page History Report an error