Dynamic Planar Point Location in External Memory.

DOI10.4230/LIPIcs.SoCG.2019.52OpenAlexW2932744841MaRDI QIDQ5088984

J. Ian Munro, Yakov Nekrich

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1903.06601

zbMATH Keywords

data structuresexternal memorydynamic data structuresplanar point location

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• External-memory algorithms for processing line segments in geographic information systems
• Dynamic fractional cascading
• Fractional cascading. I: A data structuring technique
• I/O-efficient dynamic planar point location
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• Biased Search Trees
• Two New Kinds of Biased Search Trees
• Efficient Point Location in a Convex Spatial Cell-Complex
• New Results on Dynamic Planar Point Location
• DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
• Dynamic Trees and Dynamic Point Location
• Dynamic Point Location in General Subdivisions
• External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.
• Fully Dynamic Point Location in a Monotone Subdivision
• A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
• I/O-efficient point location using persistent B-trees
• External memory planar point location with logarithmic updates

This page was built for publication: Dynamic Planar Point Location in External Memory.