Two- and three- dimensional point location in rectangular subdivisions
From MaRDI portal
Publication:5056154
DOI10.1007/3-540-55706-7_32zbMath1502.68315MaRDI QIDQ5056154
Jack Scott Snoeyink, Marc J. van Kreveld, Mark T. de Berg
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_32
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Cites Work
- Unnamed Item
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- A space-optimal solution of general region location
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Preserving order in a forest in less than logarithmic time and linear space
- Log-logarithmic worst-case range queries are possible in space theta(N)
- PLANAR POINT LOCATION REVISITED
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Filtering Search: A New Approach to Query-Answering
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Design and implementation of an efficient priority queue
- Dynamic Perfect Hashing: Upper and Lower Bounds