Adaptive and approximate orthogonal range counting

DOI10.1145/2830567MaRDI QIDQ4962621zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Bryan T. Wilkinson

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

adaptiveapproximatecomputational geometrydata structureorthogonalrange countingword RAM

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Adaptive and approximate orthogonal range counting
• Data structures for approximate orthogonal range counting
• Orthogonal range searching in linear and almost-linear space
• Orthogonal Range Searching in Linear and Almost-Linear Space
• Multidimensional range selection

Cited in

(13)

• Ranked document selection
• Range selection and predecessor queries in data aware space and time
• Efficient range searching for categorical and plain data
• Multidimensional range selection
• Data structures for approximate orthogonal range counting
• Untangled monotonic chains and adaptive range search
• Tight space bounds for two-dimensional approximate range counting
• Approximate range counting revisited
• Succinct color searching in one dimension
• Untangled monotonic chains and adaptive range search
• Adaptive and approximate orthogonal range counting
• The space complexity of 2-dimensional approximate range counting
• Adaptive data structures for 2D dominance colored range counting

This page was built for publication: Adaptive and approximate orthogonal range counting

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