Dynamic Planar Point Location in External Memory.
From MaRDI portal
Recommendations
Cites work
- A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
- Biased Search Trees
- Dynamic fractional cascading
- Dynamic planar orthogonal point location in sublogarithmic time
- Dynamic Point Location in General Subdivisions
- Dynamic Trees and Dynamic Point Location
- DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
- Efficient Point Location in a Convex Spatial Cell-Complex
- External memory planar point location with logarithmic updates
- External memory three-sided range reporting and top-\(k\) queries with sublogarithmic updates
- External-memory algorithms for processing line segments in geographic information systems
- Fractional cascading. I: A data structuring technique
- Fully Dynamic Point Location in a Monotone Subdivision
- scientific article; zbMATH DE number 1305387 (Why is no real title available?)
- I/O-efficient dynamic planar point location
- I/O-efficient point location using persistent B-trees
- New Results on Dynamic Planar Point Location
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Two New Kinds of Biased Search Trees
Cited in
(4)
This page was built for publication: Dynamic Planar Point Location in External Memory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088984)
