On approximate range counting and depth

DOI10.1145/1247069.1247129MaRDI QIDQ5901406zbMATH OpenOpenAlexFDO

Authors Peyman Afshani, Timothy M. Chan

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• On approximate range counting and depth
• Approximate halfspace range counting
• On Approximating the Depth and Related Problems
• On approximate halfspace range counting and relative epsilon-approximations
• Data structures for approximate orthogonal range counting

Cited in

(10)

• On approximating the depth and related problems
• On approximate halfspace range counting and relative epsilon-approximations
• On Approximating the Depth and Related Problems
• Approximating majority depth
• Approximate range counting revisited
• Approximate halfspace range counting
• On approximate range counting and depth
• Range minima queries with respect to a random permutation, and approximate range counting
• Convexity helps iterated search in 3D
• Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints

This page was built for publication: On approximate range counting and depth

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