Optimal external memory planar point enclosure

DOI10.1007/S00453-007-9126-2zbMATH Open1191.68200OpenAlexW2075968486MaRDI QIDQ834582FDOQ834582

Authors: Lars Arge, Vasilis Samoladas, Ke Yi 

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

Recommendations

• Algorithms – ESA 2004
• I/O-Efficient Point Location in a Set of Rectangles
• External memory planar point location with logarithmic updates
• I/O-efficient dynamic planar point location
• Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os

zbMATH Keywords

data structuresexternal memory algorithmspoint enclosure

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
• Algorithms – ESA 2004
• Title not available (Why is that?)
• Planar point location for large data sets

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

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