Adaptive and Approximate Orthogonal Range Counting

DOI10.1137/1.9781611973105.18zbMath1421.68018OpenAlexW4245730866MaRDI QIDQ5741726

Timothy M. Chan, Bryan T. Wilkinson

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.687

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 (6)

Optimal encodings for range majority queries ⋮ Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Unnamed Item ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ The Heaviest Induced Ancestors Problem Revisited

This page was built for publication: Adaptive and Approximate Orthogonal Range Counting