Space Efficient Data Structures for Dynamic Orthogonal Range Counting

DOI10.1007/978-3-642-22300-6_42zbMath1342.68111OpenAlexW149246287MaRDI QIDQ5199268

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

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

Related Items (3)

Space efficient data structures for dynamic orthogonal range counting ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Array Range Queries

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