Space efficient dynamic orthogonal range reporting

DOI10.1007/s00453-007-9030-9zbMath1131.68041OpenAlexW1991057904MaRDI QIDQ2461544

Yakov Nekrich

Publication date: 28 November 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9030-9

zbMATH Keywords

Computational geometryAlgorithms and data structuresDynamic data structuresOrthogonal range searching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

Space Efficient Multi-dimensional Range Reporting ⋮ Online recognition of dictionary with one gap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Dynamic fractional cascading
• Divided \(k-d\) trees
• Concatenable structures for decomposable problems
• A dynamic fixed windowing problem
• Applications of range query theory to relational data base join and selection operations
• Lower bounds for orthogonal range searching: part II. The arithmetic model
• Priority Search Trees
• New Data Structures for Orthogonal Range Queries
• Filtering Search: A New Approach to Query-Answering
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Cache-oblivious data structures for orthogonal range searching
• Cache-Oblivious B-Trees
• Fully Dynamic Orthogonal Range Reporting on RAM

This page was built for publication: Space efficient dynamic orthogonal range reporting