Dynamic Planar Range Maxima Queries
From MaRDI portal
Publication:3012811
DOI10.1007/978-3-642-22006-7_22zbMATH Open1332.68031OpenAlexW42881917MaRDI QIDQ3012811FDOQ3012811
Authors: 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
Recommendations
- Dynamic planar range skyline queries in log logarithmic expected time
- Dynamic 3-sided planar range queries with expected doubly logarithmic time
- On Generalized Planar Skyline and Convex Hull Range Queries
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- Encoding 2D range maximum queries
- Encoding 2D range maximum queries
- On the range maximum-sum segment query problem
- Algorithms and Computation
- A new approach to the dynamic maintenance of maximal points in a plane
- Range aggregate maximal points in the plane
Cites Work
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Symmetric binary B-trees: Data structure and maintenance algorithms
- On Finding the Maxima of a Set of Vectors
- Maintenance of configurations in the plane
- Making data structures persistent
- Optimal External Memory Interval Management
- Title not available (Why is that?)
- A new data structure for representing sorted lists
- On the dynamic maintenance of maximal points in the plane
- A new approach to the dynamic maintenance of maximal points in a plane
- On rectangular visibility
- Worst-case data structures for the priority queue with attrition
- Dynamic Maintenance of Maxima of 2-d Point Sets
Cited In (14)
- On the dynamic maintenance of maximal points in the plane
- Dynamic layers of maxima with applications to dominating queries
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues
- Range aggregate maximal points in the plane
- Dynamic rectangular intersection with priorities
- Space-efficient data-analysis queries on grids
- Reporting and counting maximal points in a query orthogonal rectangle
- Dynamic 3-sided planar range queries with expected doubly logarithmic time
- A dynamic stabbing-max data structure with sub-logarithmic query time
- Dynamic Maintenance of Maxima of 2-d Point Sets
- On Generalized Planar Skyline and Convex Hull Range Queries
- Title not available (Why is that?)
- A new approach to the dynamic maintenance of maximal points in a plane
- Dynamic planar range skyline queries in log logarithmic expected time
This page was built for publication: Dynamic Planar Range Maxima Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012811)
