Dynamic coresets

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 1-9

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Dynamic data structures; Geometric optimization; Randomization; Word RAM

Indexed keywords

APPROXIMATION ALGORITHMS; CYLINDERS (SHAPES); DATA STRUCTURES; FILE ORGANIZATION; POLYNOMIAL APPROXIMATION; RANDOM ACCESS STORAGE; STRUCTURAL OPTIMIZATION;

AMORTIZED TIMES; BOUNDING BOXES; CORE-SETS; DYNAMIC DATA STRUCTURES; GEOMETRIC OPTIMIZATION; NUMEROUS APPLICATIONS; POLYLOGARITHMIC; RANDOMIZATION; WORD RAM;

COMPUTATIONAL GEOMETRY;

EID: 57349087665     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377680     Document Type: Conference Paper

References (48)

1. P. K. Agarwal, B, Aronov, and M. Sharir. Line transversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom., 21:373-388, 1999.
2. P. K. Agarwal, S, Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. A CM, 51:606-635, 2004.
3. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via coresets. In Current Trends in Combinatorial and Computational Geometry (E. Welzl, ed.), Cambridge University Press, New York, to appear.
4. P. K. Agarwal, S. Har-Peled, and H. Yu. Robust shape fitting via peeling and grating coresets. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pages 182-191, 2006.
5. P. K. Agarwal and J. Matousek. Dynamic half-space range reporting and its applications. Algorithmica, 13:325-345, 1995.
6. P. K. Agarwal and C. M. Procopiuc. Approximation lgorithms for projective clustering. J. Algorithms, 46:115-139, 2003.
7. P. K. Agarwal and M. Sharir. Off-line dynamic maintenance of the width of a planar point set. Comput. Geom. Theory Appl, 1:65-78, 1991.
8. P. K. Agarwal and M. Sharir. Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom., 16:317-337, 1996.
9. P. K. Agarwal and H. Yu. A space-optimal data-stream algorithm for coresets in the plane. In Proc. 23rd ACM Sympos. Comput. Geom., pages 1-10, 2007.
10. M. Bǎdoiu and K. L. Clarkson. Optimal core-sets for balls. Manuscript, 2003. Preliminary version in Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 801-802, 2003.
11. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. 34th ACM Sympos. Theory Comput, pages 250-257, 2002.
12. G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms, 38:91-109, 2001.
13. J. Bentley and J. Saxe. Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms, 1:301-358, 1980.
14. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proc. 43rd IEEE Sympos. Found. Comput. Sci., pages 617-626, 2002.
15. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM, 48:1-12, 2001.
16. T. M. Chan. Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Int. .J. Comput. Geom. Appl., 12:67-85, 2002.
17. T. M. Chan. A fully dynamic algorithm for planar width. Discrete Comput. Geom., 30:17-24, 2003.
18. T. M. Chan. Semi-online maintenance of geometric optima and measures. SIAM J. Comput., 32:700-716, 2003.
19. T. M. Chan. A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pages 1196-1202, 2006.
20. T. M. Chan. Faster core-set constructions and data stream algorithms in fixed dimensions. Comput. Geom. Theory Appl, 35:20-35, 2006.
21. T. M. Chan. Well-separated pair decomposition in linear time? Inform. Process. Lett., to appear.
22. T. M. Chan and M. Pǎtraşra. Point location in sublogarithmic time and other transdichotomous results in computational geometry. Submitted to SIAM J. Comput.. Preliminary versions in Proc. 47th IEEE Sympos. Found. Comput. Sci., pages 325-332 and 333-342, 2006.
23. 0(1g 1g n) time. In Proc. 39th ACM Sympos. Theory Comput., pages 31-39, 2007.
24. T. M. Chan and B. S. Sadjad. Geometric optimization problems over sliding windows. Int. J. Comput. Geom,. Appl, 16:145-157, 2006.
25. B. Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31:509-517, 1985.
26. K. L. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S.-H. Teng. Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl, 6:357-377, 1996.
27. C. A. Duncan, M. T. Goodrich, and E. A. Ramos. Efficient approximation and optimization algorithms for computational metrology. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 121-130, 1997.
28. M. Edwards and K. R. Varadarajan. No coreset, no cry: II. In Proc. 25th Int. Conf. Found. Soft. Tech. Theoret. Comput. Sci., Lect. Notes Comput. Sci., vol. 3821, Springer-Verlag, pages 107-115, 2005.
29. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding-window models. Algorithmica, 41:25-41, 2004.
30. G. Frahling, P. Indyk, and C. Sohler. Sampling in dynamic data streams and applications. In Proc. 21st ACM Sympos. Comput. Geom., pages 142-149, 2005.
31. G. Frahling and C. Sohler. Coresets in dynamic geometric data streams. In Proc. 37th ACM Sympos. Theory Comput, pages 209-217, 2005.
32. T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., 38:293-306, 1985.
33. S. Har-Peled. Clustering motion. Discrete Comput. Geom., 31:545-565, 2004.
34. S. Har-Peled. No coreset, no cry. In Proc. 24th Int. Conf. Found. Soft. Tech. Theoret. Comput. Sci., Lect. Notes Comput. Sci., vol. 3328, Springer-Verlag, pages 324-335, 2004.
35. S. Har-Peled and A. Kushal. Smaller coresets for k-median and k-means clustering. Discrete Comput. Geom., 37:3-19, 2007.
36. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. In Proc. 36th ACM Sympos. Theory Comput., pages 291-300, 2004.
37. S. Har-Peled and K. R. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th ACM Sympos. Comput. Geom., pages 312-318, 2002.
38. S. Har-Peled and Y. Wang. Shape fitting with outliers. SIAM J. Comput., 33:269-285, 2004.
39. P. Indyk. Algorithms for dynamic geometric problems over data streams. In Proc. 36th ACM Sympos. Theory Comput, pages 373-380, 2004.
40. R. Janardan. On maintaining the width and diameter of a planar point-set online. Int. J. Comput. Geom. Appl., 3:331-344, 1993.
41. J. Matoušek. Derandomization in computational geometry. In Handbook of Computational Geometry (J. Urrutia and J. Sack, ed.), North-Holland, pages 559-595, 2000.
42. M. H. Overmars. The Design of Dynamic Data Structures. Lect. Notes in Comput. Sci., vol. 156, Springer-Verlag, 1983.
43. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Sys. Sci., 23:166-204, 1981.
44. G. Rote, C. Schwarz, and J. Snoeyink. Maintaining the approximate width of a set of points in the plane. In Proc. 5th Canad. Conf. Comput. Geom., pages 258-263, 1993.
45. M. Thorup. Equivalence between priority queues and sorting. In Proc. 43rd IEEE Sympos. Found. Comput. Sci., pages 125-134, 2002.
46. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett., 6:80-82, 1977.
47. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. Practical methods for shape fitting and kinetic data structures using core sets. In Proc. 20th ACM Sympos. Comput. Geom., pages 263-272, 2004.
48. H. Zarrabi-Zadeh. An almost space-optimal streaming algorithm for coresets in fixed dimensions. Manuscript, 2007.