Space Efficient Multi-dimensional Range Reporting

DOI10.1007/978-3-642-02882-3_22zbMath1248.68524OpenAlexW1832227987MaRDI QIDQ5323066

Yakov Nekrich, Marek Karpinski

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (4)

Space Efficient Multi-dimensional Range Reporting ⋮ Dictionary Matching with Uneven Gaps ⋮ Unnamed Item ⋮ Dictionary matching with a bounded gap in pattern or in text

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Linear space data structures for two types of range search
• Fractional cascading. I: A data structuring technique
• Preserving order in a forest in less than logarithmic time and linear space
• Decomposable searching problems
• Space efficient dynamic orthogonal range reporting
• On Dominance Reporting in 3D
• A data structure for multi-dimensional range reporting
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Space Efficient Multi-dimensional Range Reporting

This page was built for publication: Space Efficient Multi-dimensional Range Reporting