Approximation Algorithms for Minimum-Width Annuli and Shells

Discrete and Computational Geometry

Volumn 24, Issue 4, 2000, Pages 687-705

  Agarwal, P K ^a   Aronov, B ^b   Har Peled, S ^c,e   Sharir, M ^c,d  

^a Duke University   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

^e DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034365876     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s4540010062     Document Type: Article

References (29)

1. P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pages 380-389.
2. P. K. Agarwal, B. Aronov, and M. Sharir, Computing envelopes in four dimensions with applications, SIAM J. Comput., 26 (1997), 1714-1732.
3. P. K. Agarwal and M. Sharir, Efficient randomized algorithms for some geometric optimization problems, Discrete Comput. Geom., 16 (1996), 317-337.
4. P. K. Agarwal, M. Sharir, and S. Toledo, Applications of parametric searching in geometric optimization, J. Algorithms, 17 (1994), 292-318.
5. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom., 4 (1989), 591-604.
6. F. Aurenhammer and R. Klein, Voronoi diagrams, in Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, eds.), Elsevier Science/North-Holland, Amsterdam, 1999.
7. T. M. Chan, Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus, Proc. 16th Annu. ACM Sympos. Comput. Geom., 2000, pages 300-309.
8. M. de Berg, J. Bose, D. Bremner, S. Ramaswami, and G. Wilfong, Computing constrained minimum-width annuli of point sets, Proc. 5th Workshop Algorithms Data Struct., Lecture Notes in Computer Science, Vol. 1272, Springer-Verlag, Berlin, 1997, pp. 3-16.
9. C. A. Duncan, M. T. Goodrich, and E. A. Ramos, Efficient approximation and optimization algorithms for computational metrology, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 121-130.
10. M. Dyer and N. Megiddo, Linear programming in low dimensions, in Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, FL, 1997, pp. 699-710.
11. H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi, Roundness algorithms using the Voronoi diagrams, Abstracts 1st Canad. Conf. Comput. Geom., 1989, p. 41.
12. H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput., 15 (1986), 317-340.
13. O. Egecioglu and B. Kalantari, Approximating the diameter of a set of points in the Euclidean space, Inform. Process. Lett., 32 (1989), 205-211.
14. L. W. Foster, GEO-METRICS II: The Application of Geometric Tolerancing Techniques, Addison-Wesley, Reading, MA, 1982.
15. J. García-Lopez and P. Ramos, Fitting a set of points by a circle, Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 139-146.
16. S. Har-Peled. Constructing approximate shortest path maps in three dimensions, SIAM J. Comput., 28 (1999), 1182-1197.
17. R. Kumar and D. Sivakumar, Roundness estimation via random sampling, Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, 1999, pp. 603-612.
18. V. B. Le and D. T. Lee, Out-of-roundness problem revisited, IEEE Trans. Pattern Anal. Mach. Intell., 13 (1991), 217-223.
19. J. Matoušek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, Algorithmica, 16 (1996), 498-516.
20. K. Mehlhorn, T. Shermer, and C. Yap, A complete roundness classification procedure, Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 129-138.
21. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou, The discrete geodesic problem, SIAM J. Comput., 16 (1987), 647-668.
22. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
23. T. J. Rivlin, Approximating by circles, Computing, 21 (1979), 93-104.
24. U. Roy, C. R. Liu, and T. C. Woo, Review of dimensioning and tolerancing: representation and processing, Comput. Aided Design, 23 (1991), 466-483.
25. U. Roy and X. Zhang, Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error, Comput. Aided Design, 24 (1992), 161-168.
26. T. C. Shermer and C. K. Yap, Probing for near centers and relative roundness, Proc. ASME Workshop on Tolerancing and Metrology, 1995.
27. M. Smid and R. Janardan, On the width and roundness of a set of points in the plane. Internat. J. Comput. Geom. Appl., 9 (1999), 97-108.
28. K. Swanson, D. T. Lee, and V. L. Wu, An optimal algorithm for roundness determination on convex polygons, Comput. Geom. Theory Appl., 5 (1995), 225-235.
29. C. K. Yap and E.-C. Chang, Issues in the metrology of geometric tolerancing, in Algorithms for Robotic Motion and Manipulation (J.-P. Laumond and M. Overmars, ed.), A.K. Peters, Wellesley, MA, 1997, pp. 393-400.