Faster core-set constructions and data-stream algorithms in fixed dimensions

Computational Geometry: Theory and Applications

Volumn 35, Issue 1-2 SPEC. ISS., 2006, Pages 20-35

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Data streams; Geometric optimization problems

Indexed keywords

EID: 33646816052     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.10.002     Document Type: Conference Paper

References (32)

1. P.K. Agarwal, B. Aronov, and M. Sharir Line transversals of balls smallest enclosing cylinders in three dimensions Discrete Comput. Geom. 21 1999 373 388
2. P.K. Agarwal, L.J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir Computing the penetration depth of two convex polytopes in 3D Nordic J. Comput. 7 2000 227 240
3. P.K. Agarwal, S. Krishnan, N.H. Mustafa, and S. Venkatasubramanian Streaming geometric optimization using graphics hardware Proc. 11th European Sympos. Algorithms Lecture Notes Comput. Sci. vol. 2832 2003 Springer-Verlag Berlin 544 555
4. P.K. Agarwal, S. Har-Peled, K.R. Varadarajan, Approximating extent measures of points, J. ACM, submitted for publication. Preliminary versions appeared in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 148-157; Proc. 42nd IEEE Sympos. Found. Comput. Sci., 2001, pp. 66-73
5. P.K. Agarwal, J. Matoušek, and S. Suri Farthest neighbors maximum spanning trees and related problems in higher dimensions Computational Geometry 1 1992 189 201
6. S. Arya, T. Malamatos, D.M. Mount. Space-efficient approximate Voronoi diagrams, in: Proc. 34th ACM Sympos. Theory Comput., 2002, pp. 721-730
7. M. Badoiu, K.L. Clarkson, Optimal core-sets for balls, Manuscript, 2003, Preliminary version in: Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, 2003, pp. 801-802
8. M. Badoiu, S. Har-Peled, P. Indyk, Approximate clustering via core-sets, in: Proc. 34th ACM Sympos. Theory Comput., 2002, pp. 250-257
9. G. Barequet, and S. Har-Peled Efficiently approximating the minimum-volume bounding box of a point set in three dimensions J. Algorithms 38 2001 91 109
10. J. Bentley, and J. Saxe Decomposable searching problems I: Static-to-dynamic transformation J. Algorithms 1 1980 301 358
11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer-Verlag Heidelberg
12. H. Breu, J. Gil, D. Kirkpatrick, and M. Werman Linear time Euclidean distance transform algorithms IEEE Trans. Pattern Anal. Machine Intell. 17 1995 529 533
13. E.M. Bronshteyn, and L.D. Ivanov The approximation of convex sets by polyhedra Siberian Math. J. 16 1976 852 853
14. T.M. Chan Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Int. J. Comput. Geom. Appl. 12 2002 67 85
15. T.M. Chan, and B.S. Sadjad Geometric optimization problems over sliding windows Proc. 15th Int. Sympos. Algorithms and Computation Lecture Notes Comput. Sci. vol. 3341 2004 Springer-Verlag Berlin 246 258
16. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 McGraw-Hill New York
17. R.M. Dudley Metric entropy of some classes of sets with differentiable boundaries J. Approx. Theory 10 1974 227 236
18. C.A. Duncan, M.T. Goodrich, E.A. Ramos, Efficient approximation and optimization algorithms for computational metrology, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 121-130
19. J. Feigenbaum, S. Kannan, and J. Zhan Computing diameter in the streaming sliding-window models Algorithmica 41 2004 25 41
20. S. Har-Peled, A practical approach for computing the diameter of a point-set, in: Proc. 17th ACM Sympos. Comput. Geom., 2001, pp. 177-186
21. S. Har-Peled, A replacement for Voronoi diagrams of near linear size, in: Proc. 42nd IEEE Sympos. Found. Comput. Sci., 2001, pp. 94-103
22. S. Har-Peled, K. Varadarajan, High-dimensional shape fitting in linear time, in: Proc. 19th ACM Sympos. Comput. Geom., 2003, pp. 39-47
23. S. Har-Peled, and Y. Wang Shape fitting with outliers SIAM J. Comput. 33 2004 269 285
24. M. Henzinger, P. Raghavan, S. Rajagopalan, Computing on data streams, Technical Note 1998-011, Digital Systems Research Center, Palo Alto, CA, 1998
25. J. Hershberger, S. Suri, Adaptive sampling for geometric problems over data streams, in: Proc. 23rd Sympos. Principles on Database Systems, 2004, pp. 252-262
26. P. Indyk, Better algorithms for high-dimensional proximity problems via asymmetric embeddings, in: Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, 2003, pp. 539-545
27. R. Janardan On maintaining the width and diameter of a planar point-set online Int. J. Comput. Geom. Appl. 3 1993 331 344
28. G. Malandain, and J.-D. Boissonnat Computing the diameter of a point set Int. J. Comput. Geom. Appl. 12 2002 489 510
29. S. Muthukrishnan, Data streams: Algorithms and applications, Manuscript, 2003
30. G. Rote, C. Schwarz, J. Snoeyink, Maintaining the approximate width of a set of points in the plane, in: Proc. 5th Canad. Conf. Comput. Geom., 1993, pp. 258-263
31. O. Schwarzkopf Parallel computation of distance transforms Algorithmica 6 1991 685 697
32. H. Yu, P.K. Agarwal, R. Poreddy, K.R. Varadarajan, Practical methods for shape fitting and kinetic data structures using core sets, in: Proc. 20th ACM Sympos. Comput. Geom., 2004, pp. 263-272