I/O-efficient dynamic planar point location
type: Item
instance of: scholarly article
title: I/O-efficient dynamic planar point location
zbMATH Open document ID: 1056.68062
author: Lars Arge
author: Jan Vahrenhold
published in: Computational Geometry
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 2105224
zbMATH Keywords: dynamic data structure
zbMATH Keywords: logarithmic method
MaRDI profile type: Publication
full work available at URL: j.comgeo.2003.04.001
OpenAlex ID: W2041762692
cites work: Q4252266
cites work: Q4552048
cites work: I/O-efficient point location using persistent B-trees
cites work: Q4250238
cites work: External-memory algorithms for processing line segments in geographic information systems
cites work: Optimal External Memory Interval Management
cites work: Dynamic Point Location in General Subdivisions
cites work: Organization and maintenance of large ordered indexes
cites work: Decomposable searching problems
cites work: Fractional cascading. I: A data structuring technique
cites work: New Results on Dynamic Planar Point Location
cites work: A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
cites work: Q3853109
cites work: RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
cites work: A new approach to rectangle intersections part I
cites work: Optimal Point Location in a Monotone Subdivision
cites work: A space-optimal solution of general region location
cites work: A new data structure for representing sorted lists
cites work: Optimal Search in Planar Subdivisions
cites work: Dynamic fractional cascading
cites work: The design of dynamic data structures
cites work: Q4401020
cites work: Dynamic maintenance of planar digraphs, with applications
cites work: Planar point location for large data sets
DOI: 10.1016/J.COMGEO.2003.04.001
description: scientific article; zbMATH DE number 2105224