Abstract
We propose a simple, optimal-space algorithm for maintaining an extent coreset for a data stream of points in the plane. For a given parameter r, the coreset consists of a sample of Θ(r) points from the stream seen so far. The coreset property is that for any slab (defined by two parallel lines) that encloses the sample, a (1 + ε) expansion of the slab encloses all the stream points seen so far, for ε = O(1/r 2). The coreset can be maintained in O(logr) amortized time per point of the stream.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P., Har-Peled, S., Varadarajan, K.: Geometric approximations via coresets. Combinatorial and Computational Geometry – MSRI Pub. 52, 1–30 (2005)
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606–635 (2004)
Agarwal, P.K., Yu, H.: A space-optimal data-stream algorithm for coresets in the plane. In: Proc. 23rd Ann. Symp. Comput. Geometry, pp. 1–10. ACM, New York (2007)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. Theory Appl. 35(1), 20–35 (2006)
Cormode, G., Muthukrishnan, S.: An improved data stream summary: The count-min sketch and its applications. J. Algorithms 55(1), 58–75 (2005)
Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31(2), 182–209 (1985)
Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Proc. ACM SIGMOD Intl. Conf. Mgmt. of Data, pp. 58–66. ACM Press, New York (2001)
Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. In: Proc. 23rd ACM Symp. Principles of Database Syst., pp. 252–262 (2004)
Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: Foundations and Trends in Theoretical Computer Science, vol. 1(2), Now Publishers, Delft, Netherlands (2005)
Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)
Shrivastava, N., Buragohain, C., Agrawal, D., Suri, S.: Medians and beyond: New aggregation techniques for sensor networks. In: SenSys 2004, pp. 239–249. ACM, New York (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hershberger, J., Suri, S. (2008). Simplified Planar Coresets for Data Streams. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)