Two- and three- dimensional point location in rectangular subdivisions
From MaRDI portal
Recommendations
Cites work
- A priority queue in which initialization and queue operations takeO(loglogD) time
- A space-optimal solution of general region location
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- Design and implementation of an efficient priority queue
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Filtering Search: A New Approach to Query-Answering
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- Log-logarithmic worst-case range queries are possible in space theta(N)
- PLANAR POINT LOCATION REVISITED
- Preserving order in a forest in less than logarithmic time and linear space
- Storing a Sparse Table with 0 (1) Worst Case Access Time
Cited in
(5)
This page was built for publication: Two- and three- dimensional point location in rectangular subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056154)