Space Efficient Data Structures for Dynamic Orthogonal Range Counting

DOI10.1007/978-3-642-22300-6_42MaRDI QIDQ5199268zbMATH OpenOpenAlexFDO

Authors Meng He, J. Ian Munro

Publication date 12 August 2011

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-22300-6_42

Mathematics Subject Classification ID

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

Recommendations

• Space efficient data structures for dynamic orthogonal range counting
• Data structures for approximate orthogonal range counting
• Efficient Data Structures for the Orthogonal Range Successor Problem
• Space efficient dynamic orthogonal range reporting
• Space efficient dynamic orthogonal range reporting
• Cache-oblivious data structures for orthogonal range searching
• Space-Time Trade-Offs for Orthogonal Range Queries
• Compact and succinct data structures for multidimensional orthogonal range searching
• scientific article; zbMATH DE number 7740901
• New Data Structures for Orthogonal Range Queries

Cited in

(9)

• Efficient Data Structures for the Orthogonal Range Successor Problem
• Orthogonal Range Searching in Linear and Almost-Linear Space
• Array range queries
• Space efficient dynamic orthogonal range reporting
• Succinct and Implicit Data Structures for Computational Geometry
• Succinct dynamic one-dimensional point reporting
• Dynamic range selection in linear space
• scientific article; zbMATH DE number 7740901 (Why is no real title available?)
• Space efficient data structures for dynamic orthogonal range counting

This page was built for publication: Space Efficient Data Structures for Dynamic Orthogonal Range Counting

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