Adaptive sampling for geometric problems over data streams

Computational Geometry: Theory and Applications

Volumn 39, Issue 3, 2008, Pages 191-208

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

Author keywords

Convex hulls; Geometric approximations; Single pass algorithms; Stream processing

Indexed keywords

EID: 84867947124     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.10.004     Document Type: Article

References (27)

1. P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan Approximating extent measures of points J. ACM 51 4 2004 606 635
2. N. Alon, Y. Matias, and M. Szegedy The space complexity of approximating the frequency moments J. Comput. Syst. Sci. 58 1 1999 137 147
3. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proc. 21st ACM Sympos. Principles Database Syst., 2002
4. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications second ed. 2000 Springer-Verlag Berlin, Germany
5. T. Chan, Faster core-set constructions and data stream algorithms in fixed dimensions, in: Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004, pp. 152-159
6. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press Cambridge, MA
7. G. Cormode, S. Muthukrishnan, Radial histogram for spatial streams, Technical Report 2003-11, DIMACS, 2003
8. R.M. Dudley Metric entropy of some classes of sets with differentiable boundaries J. Approx. Theory 10 1974 227 236
9. http://www.earthscope.org
10. P. van Emde Boas Preserving order in a forest in less than logarithmic time and linear space Inf. Process. Lett. 6 3 1977 80 82
11. P. van Emde Boas, R. Kaas, and E. Zijlstra Design and implementation of an efficient priority queue Math. Systems Theory 10 1977 99 127
12. L 1-difference algorithm for massive data streams, in: IEEE Sympos. Found. Comput. Sci., 1999, pp. 501-511
13. J. Feigenbaum, S. Kannan, J. Zhang, Computing diameter in the streaming and sliding-window models, 2002. Manuscript
14. J. Gray, A. Szalay, A. Thakar, P.Z. Zunszt, T. Malik, J. Raddick, C. Stoughton, J. van den Berg, The SDSS SkyServer: Public access to the Sloan digital sky server data, Technical Report MSR-TR-2001-104, Microsoft Research, 2001
15. M. Greenwald, S. Khanna, Space-efficient online computation of quantile summaries, in: Proc. ACM SIGMOD Intl. Conf. on Management of Data, 2001
16. P.M. Gruber Approximation of convex bodies P.M. Gruber, J.M. Wills, Convexity and its Applications 1983 Birkhäuser Basel, Switzerland 131 162
17. J. Hershberger, N. Shrivastava, S. Suri, Summarizing spatial data streams using ClusterHulls, in: Proc. 8th Workshop on Algorithm Engineering and Experiments (ALENEX), 2006, pp. 26-40
18. P. Indyk, Stream-based geometric algorithms, in: Proc. ACM/DIMACS Workshop on Management and Processing of Data Streams, 2003
19. N.M. Josuttis The C++ Standard Library: A Tutorial and Reference 1999 Addison-Wesley Reading, MA
20. P.S. Kenderov Polygonal approximation of plane convex compacts J. Approx. Theory 38 1983 221 239
21. G.S. Manku, S. Rajagopalan, B.G. Lindsay, Random sampling techniques for space efficient online computation of order statistics of large datasets, in: Proc. ACM SIGMOD Intl. Conf. on Management of Data, 1999
22. Y. Matias, J.S. Vitter, N. Young, Approximate data structures with applications, in: Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, 1994, pp. 187-194
23. D.E. McClure, and R.A. Vitale Polygonal approximation of plane convex bodies J. Math. Anal. Appl. 51 1975 326 358
24. S. Muthukrishnan, Data streams: Algorithms and applications, Technical report, Computer Science Department, Rutgers University, 2003
25. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer-Verlag New York
26. W. Pugh Skip lists: a probabilistic alternative to balanced trees Commun. ACM 33 6 1990 668 676
27. T.J. Richardson Approximation of planar convex sets from hyperplane probes Discrete Comput. Geom. 18 2 1997 151 177