Deterministic sampling and range counting in geometric data streams

DOI10.1145/1240233.1240239MaRDI QIDQ2944553zbMATH OpenOpenAlexWikidataFDO

Authors Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich

Publication date 2 September 2015

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

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

zbMATH Keywords

data streamsepsilon netsgeometric dataiceberg queriesrange countingrobust statisticssamplingstreaming algorithms

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Theory of data (68P99) Analysis of algorithms (68W40)

Recommendations

• Deterministic sampling and range counting in geometric data streams
• SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
• Sampling in dynamic data streams and applications
• Adaptive sampling for geometric problems over data streams
• Range counting over multidimensional data streams

Cited in

(6)

• From approximate balls to approximate ellipses
• SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
• The Communication Complexity of Distributed epsilon-Approximations
• Deterministic sampling and range counting in geometric data streams
• Sampling in dynamic data streams and applications
• Competitive data-structure dynamization

This page was built for publication: Deterministic sampling and range counting in geometric data streams

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