A data structure for multi-dimensional range reporting

DOI10.1145/1247069.1247130MaRDI QIDQ3602892zbMATH OpenOpenAlexFDO

Authors Yakov Nekrich

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247130

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Space Efficient Multi-dimensional Range Reporting
• Space efficient dynamic orthogonal range reporting
• Space efficient dynamic orthogonal range reporting
• Dynamic range reporting in external memory
• Orthogonal range searching in linear and almost-linear space

Cited in

(13)

• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Simplex range reporting on a pointer machine
• Multidimensional range selection
• On Dominance Reporting in 3D
• Efficient data structures for range searching on a grid
• OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
• Optimal static range reporting in one dimension
• Space Efficient Multi-dimensional Range Reporting
• Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
• scientific article; zbMATH DE number 7651193 (Why is no real title available?)
• Linear space adaptive data structures for planar range reporting
• Dynamic longest common substring in polylogarithmic time
• Path and ancestor queries over trees with multidimensional weight vectors

This page was built for publication: A data structure for multi-dimensional range reporting

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