External memory planar point location with logarithmic updates
From MaRDI portal
Publication:5920252
DOI10.1007/s00453-011-9541-2zbMath1267.68100OpenAlexW2119570197MaRDI QIDQ5920252
Gerth Stølting Brodal, S. Srinivasa Rao, Lars Arge
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9541-2
Related Items (2)
Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os ⋮ Dynamic Planar Point Location in External Memory.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- External-memory algorithms for processing line segments in geographic information systems
- A space-optimal solution of general region location
- A new data structure for representing sorted lists
- I/O-efficient dynamic planar point location
- Organization and maintenance of large ordered indexes
- A new approach to rectangle intersections part I
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- New Results on Dynamic Planar Point Location
- Dynamic Point Location in General Subdivisions
- Optimal External Memory Interval Management
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
- Planar point location for large data sets
- I/O-efficient point location using persistent B-trees
- External memory planar point location with logarithmic updates
This page was built for publication: External memory planar point location with logarithmic updates
