Dynamic Planar Range Maxima Queries
From MaRDI portal
Publication:3012811
DOI10.1007/978-3-642-22006-7_22zbMath1332.68031OpenAlexW42881917MaRDI QIDQ3012811
Gerth Stølting Brodal, Konstantinos Tsakalidis
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_22
Related Items (5)
I/O-efficient 2-d orthogonal range skyline and attrition priority queues ⋮ Dynamic layers of maxima with applications to dominating queries ⋮ Space-efficient data-analysis queries on grids ⋮ Dynamic planar range skyline queries in log logarithmic expected time ⋮ Reporting and counting maximal points in a query orthogonal rectangle
Cites Work
- A new approach to the dynamic maintenance of maximal points in a plane
- Making data structures persistent
- Maintenance of configurations in the plane
- A new data structure for representing sorted lists
- On the dynamic maintenance of maximal points in the plane
- Worst-case data structures for the priority queue with attrition
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Symmetric binary B-trees: Data structure and maintenance algorithms
- On rectangular visibility
- On Finding the Maxima of a Set of Vectors
- Optimal External Memory Interval Management
- Dynamic Maintenance of Maxima of 2-d Point Sets
- Unnamed Item
This page was built for publication: Dynamic Planar Range Maxima Queries
