I/O-efficient dynamic planar point location

DOI10.1016/J.COMGEO.2003.04.001MaRDI QIDQ1882856zbMATH OpenOpenAlexFDO

Authors Lars Arge, Jan Vahrenhold

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

zbMATH Keywords

dynamic data structurelogarithmic method

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• External memory planar point location with logarithmic updates
• External memory planar point location with logarithmic updates
• Dynamic planar point location with optimal query time
• scientific article; zbMATH DE number 1305387
• I/O-Efficient Point Location in a Set of Rectangles

Cites work

• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 1303612 (Why is no real title available?)
• scientific article; zbMATH DE number 1305387 (Why is no real title available?)
• scientific article; zbMATH DE number 1182923 (Why is no real title available?)
• scientific article; zbMATH DE number 1792106 (Why is no real title available?)
• A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
• A new approach to rectangle intersections part I
• A new data structure for representing sorted lists
• A space-optimal solution of general region location
• Decomposable searching problems
• Dynamic Point Location in General Subdivisions
• Dynamic fractional cascading
• Dynamic maintenance of planar digraphs, with applications
• External-memory algorithms for processing line segments in geographic information systems
• Fractional cascading. I: A data structuring technique
• I/O-efficient point location using persistent B-trees
• New Results on Dynamic Planar Point Location
• Optimal External Memory Interval Management
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Organization and maintenance of large ordered indexes
• Planar point location for large data sets
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
• The design of dynamic data structures

Cited in

(16)

• Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
• Dynamic Planar Point Location in External Memory.
• Optimal external memory planar point enclosure
• Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 4082961 (Why is no real title available?)
• External memory planar point location with logarithmic updates
• Cache-oblivious R-trees
• Dynamic planar point location with optimal query time
• The complexity of flow on fat terrains and its i/o-efficient computation
• A space-efficient framework for dynamic point location
• I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
• Planar point location for large data sets
• I/O-efficient point location using persistent B-trees
• I/O-Efficient Point Location in a Set of Rectangles
• External memory planar point location with logarithmic updates

This page was built for publication: I/O-efficient dynamic planar point location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882856)