I/O-efficient dynamic planar point location
From MaRDI portal
Publication:1882856
DOI10.1016/j.comgeo.2003.04.001zbMath1056.68062OpenAlexW2041762692MaRDI QIDQ1882856
Publication date: 1 October 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.04.001
Related Items (6)
Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os ⋮ The complexity of flow on fat terrains and its i/o-efficient computation ⋮ Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions ⋮ Cache-oblivious R-trees ⋮ External memory planar point location with logarithmic updates ⋮ Dynamic Planar Point Location in External Memory.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- Dynamic fractional cascading
- Dynamic maintenance of planar digraphs, with applications
- Fractional cascading. I: A data structuring technique
- A space-optimal solution of general region location
- A new data structure for representing sorted lists
- Decomposable searching problems
- 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 algorithms for processing line segments in geographic information systems
This page was built for publication: I/O-efficient dynamic planar point location
