Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
Given a planar subdivision whose coordinates are integers bounded by U ≤ 2w [U less than or equal to 2 superscript w], we present a linear-space data structure that can answer point-location queries in O(min{lg n/ lg lg n, sq rt lg U/ lg lgU}) [O(min {lg n / lg lg n, square root of lg U/lg lg U})] t...
| Váldodahkkit: | , |
|---|---|
| Eará dahkkit: | |
| Materiálatiipa: | Artihkal |
| Giella: | en_US |
| Almmustuhtton: |
Society for Industrial and Applied Mathematics (SIAM)..
2011
|
| Liŋkkat: | http://hdl.handle.net/1721.1/64948 |