Reporting and counting maximal points in a query orthogonal rectangle
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- Counting Maximal Points in a Query Orthogonal Rectangle
- Data structures for range minimum queries in multidimensional arrays
- Dynamic Planar Range Maxima Queries
- Fast Algorithms for Finding Nearest Common Ancestors
- Improved data structures for the orthogonal range successor problem
- On counting range maxima points in plane
- On space efficient two dimensional range minimum data structures
- Optimal succinctness for range minimum queries
- Range aggregate maximal points in the plane
- Sorted range reporting
Cited in
(3)
This page was built for publication: Reporting and counting maximal points in a query orthogonal rectangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253906)