Optimal external memory planar point enclosure

DOI10.1007/S00453-007-9126-2zbMath1191.68200OpenAlexW2075968486MaRDI QIDQ834582

Ke Yi, Lars Arge, Vasilis Samoladas

Publication date: 27 August 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9126-2

zbMATH Keywords

data structuresexternal memory algorithmspoint enclosure

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (2)

Unnamed Item ⋮ IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Fractional cascading. I: A data structuring technique
• Making data structures persistent
• On a model of indexability and its bounds for range queries
• Lower bounds for orthogonal range searching: I. The reporting case
• A new approach to rectangle intersections part I
• Filtering Search: A New Approach to Query-Answering
• How to find a battleship
• Optimal External Memory Interval Management
• The priority R-tree
• Box-trees and R-trees with near-optimal query time
• I/O-efficient point location using persistent B-trees

This page was built for publication: Optimal external memory planar point enclosure