Space efficient dynamic orthogonal range reporting
From MaRDI portal
Recommendations
Cited in
(19)- Linear space adaptive data structures for planar range reporting
- Orthogonal range searching in linear and almost-linear space
- Space efficient dynamic orthogonal range reporting
- Fully Dynamic Orthogonal Range Reporting on RAM
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Efficient dynamic range searching using data replication
- Dynamic orthogonal range searching on the RAM, revisited
- Four-dimensional dominance range reporting in linear space
- Succinct dynamic one-dimensional point reporting
- Space Efficient Multi-dimensional Range Reporting
- scientific article; zbMATH DE number 2079392 (Why is no real title available?)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- A data structure for multi-dimensional range reporting
- Dynamic range selection in linear space
- Amortized bounds for dynamic orthogonal range reporting
- Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- Space efficient data structures for dynamic orthogonal range counting
- Entropy-bounded representation of point grids
This page was built for publication: Space efficient dynamic orthogonal range reporting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370626)