Adaptive and Approximate Orthogonal Range Counting

DOI10.1145/2830567zbMath1421.68017OpenAlexW2295356180MaRDI QIDQ4962621

Bryan T. Wilkinson, Timothy M. Chan

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2830567

zbMATH Keywords

computational geometryorthogonaladaptivedata structureapproximaterange countingword RAM

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

Range selection and predecessor queries in data aware space and time ⋮ Efficient range searching for categorical and plain data ⋮ Adaptive data structures for 2D dominance colored range counting ⋮ Ranked document selection ⋮ Succinct Color Searching in One Dimension

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