Practical methods for shape fitting and kinetic data structures using core sets

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 263-272

  Yu, Hai ^a   Agarwal, Pankaj K ^a   Poreddy, Raghunath ^b   Varadarajan, Kasturi R ^b  

^a Duke University   (United States)

^b University of Iowa   (United States)

Author keywords

Core sets; Extent measures; Kinetic data structures; Shape fitting

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; ITERATIVE METHODS; LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PARAMETER ESTIMATION; POLYNOMIALS; SET THEORY;

CORE SETS; EXTENT MEASURES; KINETIC DATA STRUCTURES; SHAPE FITTING;

DATA STRUCTURES;

EID: 4544233151     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997858     Document Type: Conference Paper

References (24)

1. 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.
2. P. K. Agarwal, B. Aronov, and M. Sharir, Line transversals of balls and smallest enclosing cylinders in three dimensions, Discrete Comput. Geom., 21 (1999), 373-388.
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. R. Varadarajan, Approximating extent measures of points, Journal of the ACM, to appear.
6. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom., 11 (1994), 393-418.
7. P. K. Agarwal, C. M. Procopiuc, and K. R. Varadarajan, Approximation algorithms for k-line center, Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 54-63.
8. S. Arya, D. M. Mount, N. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions, Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, 1994, pp. 573-582.
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. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, J. Algorithms, 31 (1999), 1-28.
11. M. Bǎdoiu and K. Clarkson, Smaller core-sets for balls, Proc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms, 2003, pp. 801-802.
12. M. Bǎdoiu, S. Har-Peled, and P. Indyk, Approximate clustering via core-sets, Proc. 34th Annu. ACM Sympos. Theory Comput., 2002, pp. 250-257.
13. T. M. Chan, Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus, Internat. J. Comput. Geom. Appl., 12 (2002), 67-85.
14. T. M. Chan, Faster core-set constructions and data stream algorithms in fixed dimensions, this proceedings.
15. K. L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, Journal of the ACM, 42(1995), 488-499.
16. B. Gärtner, A subexponential algorithm for abstract optimization problems, SIAM J. Comput., 24 (1995), 1018-1035.
17. B. Gärtner, Smallest enclosing ball - fast and robust in C++, http://www.inf.ethz.ch/personal/gaertner/miniball.html
18. S. Har-Peled and Y. Wang, Shape fitting with outliers, Proc. 19th Annu. ACM Sympos. Comput. Geom., 2003, pp. 29-38.
19. P. Kumar, J. Mitchell, and E. Yildirim, Computing core-sets and approximate smallest enclosing hyper-spheres in high dimensions, Proc. 5th Workshop Algorithm Eng. Exper., 2003, pp. 45-55.
20. P. Kumar and E. Yildirim, Approximating minimum volume enclosing ellipsoids using core sets, Unpublished manuscript, 2003.
21. Large geometric models archive, http://www.cc.gatech.edu/projects/large_models/
22. D. Mount and S. Arya, ANN: library for approximate nearest neighbor searching, http://www.cs.und.edu/~mount/ANN/
23. A. C. Yao, On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Comput., 11 (1982), 721-736.
24. Y. Zhou and S. Suri, Algorithms for a minimum volume enclosing simplex in three dimensions, SIAM J. Comput., 31 (2002), 1339-1357.