I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions

DOI10.1007/978-3-540-77120-3_44zbMath1193.68276OpenAlexW2127752113MaRDI QIDQ5387782

Laura Toma, Shripad Thite, Herman J. Haverkort, Mark T. de Berg

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/235886bf-c08c-49d2-b0fb-fd62e2422199

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear size binary space partitions for uncluttered scenes
• Approximate range searching
• Realistic input models for geometric algorithms
• Cache-Oblivious Algorithms
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
• An effective way to represent quadtrees
• I/O-efficient dynamic planar point location (extended abstract)
• Cache-Oblivious B-Trees
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• External-memory algorithms for processing line segments in geographic information systems

This page was built for publication: I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions