Deterministic sampling and range counting in geometric data streams
From MaRDI portal
Publication:2944553
DOI10.1145/1240233.1240239zbMath1321.68557OpenAlexW3121225887WikidataQ56607623 ScholiaQ56607623MaRDI QIDQ2944553
David Eppstein, Amitabha Bagchi, Amitabh Chaudhary, 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
samplingrobust statisticsstreaming algorithmsdata streamsepsilon netsrange countinggeometric dataiceberg queries
Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Theory of data (68P99)
Related Items
From approximate balls to approximate ellipses, The Communication Complexity of Distributed epsilon-Approximations