Robust shape fitting via peeling and grating coresets

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 182-191

  Agarwal, Pankaj K ^a   Har Peled, Sariel ^b   Yu, Hai ^a  

^a Duke University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR ALGEBRA; PROBLEM SOLVING; TIME SERIES ANALYSIS;

CORESETS; GRATING; KERNELS;

SET THEORY;

EID: 33244483831     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109579     Document Type: Conference Paper

References (22)

1. P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. S. Vitter, Efficient searching with linear constraints, Journal of Computer and System Sciences, 61 (2000), 192-216.
2. P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Discrete Comput. Geom., 24 (2000), 687-705.
3. P. K. Agarwal, B. Aronov, and M. Sharir, Exact and approximation algorithms for minimum-width cylindrical shells, Discrete Comput. Geom., 26 (2001), 307-320.
4. P. K. Agarwal, L. J. Guibas, J. Hershberger, and E. Veach, Maintaining the extent of a moving point set, Discrete Comput. Geom., 26 (2001), 353-374.
5. P. K. Agarwal, S. Har-Peled, and K. Varadarajan, Geometric approximation via coresets, in: Combinatorial and Computational Geometry (J. E. Goodman, J. Pach, and E. Welzl, eds.), Math. Sci. Research Inst. Pub., Cambridge, 2005.
6. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, Approximating extent measures of points, J. Assoc. Comput. Mach., 51 (2004), 606-635.
7. B. Aronov and S. Har-Peled, On approximating the depth and related problems, Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, 2005, pp. 886-894.
8. 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.
9. J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, J. Algorithms, 31 (1999), 1-28.
10. T. M. Chan, Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus, Internat. J. Comput. Geom. Appl., 12 (2002), 67-85.
11. T. M. Chan, Low-dimensional linear programming with violations, Proc. 43th Annu. IEEE Sympos. Found. Comput. Sci., 2002, pp. 570-579.
12. T. M. Chan, Faster coreset constructions and data stream algorithms in fixed dimensions, Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004, pp. 152-159.
13. B. Chazelle, Cutting hyperplanes for divide-and-conquer, Discrete Comput. Geom., 9 (1993), 145-158.
14. B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality, BIT, 25 (1985), 76-90.
15. B. Chazelle and F. P. Preparata, Halfspace range search: an algorithmic application of k-sets, Discrete Comput. Geom., 1 (1986), 83-93.
16. R. Cole, M. Sharir, and C. K. Yap, On k-hulls and related problems, SIAM J. Comput., 16 (1987), 61-77.
17. S. Har-Peled and Y. Wang, Shape fitting with outliers, SIAM J. Comput., 33 (2004), 269-285.
18. Large geometric models archive. Georgia Tech. http://www.cc.gatech.edu/ projects/large_models/.
19. J. Matoušek, Approximate levels in line arrangements, SIAM J. Comput., 20 (1991), 222-227.
20. J. Matoušek, On geometric optimization with few violated constraints, Discrete Comput. Geom., 14 (1995), 365-384.
21. J. Matoušek, Lectures on Discrete Geometry, Springer, 2002.
22. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan, Practical methods for shape fitting and kinetic data structures using core sets, Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004, pp. 263-272.