Fitting a set of points by a circle

Discrete and Computational Geometry

Volumn 20, Issue 3, 1998, Pages 389-402

  Garcia Lopez J ^a   Ramos, P A ^b   Snoeyink, J ^c  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040086538     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009392     Document Type: Article

References (19)

1. P. Agarwal and M. Sharir. Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom. 16 (1996), 317-337.
2. P. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms 17 (1994), 292-318.
3. 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.
4. M. de Berg, P. Bose, D. Bremner, S. Ramaswami, and G. Wilfong. Computing constrained minimum width annuli of point sets, Proc. WADS 97, 1997, pp. 3-16.
5. C. A Duncan, M. T. Goodrich, and E. A. Ramos. Efficient approximation and optimization algorithms for computational metrology. Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 121-130.
6. H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi. Roundness algorithms using Voronoi diagrams. Abstracts 1st Canad. Conf. on Computational Geometry, 1989, p. 41.
7. H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986), 317-340.
8. L. W. Foster. GEO-METRICS II: The Application of Geometric Tolerancing Techniques. Addison-Wesley, Reading, MA, 1982.
9. G. Henzold. Handbook of Geometrical Tolerancing, J Wiley, New York, 1995.
10. V. B. Le and D. T. Lee. Out-of-roundness problem revisited. IEEE Trans. Pattern Anal. Mach. Intell., 13 (1991), 217-223.
11. K. Mehlhorn, T. Shermer, and C. Yap. A complete roundness classification procedure, Proc. 13th ACM Ann. Symp. on Computational Geometry, 1997, pp. 129-138.
12. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.
13. T. J. Rivlin. Approximation by circles, Computing 21 (1979), 93-104.
14. U. Roy and X. Zhang. Establishment of a pair of concentric circles with the minimum radial separation for assessing rounding error. Computer-Aided Design 24(3) (1992), 161-168.
15. T. Shermer and C. K. Yap. Probing for near-centers and approximate relative roundness, June 21-23, 1995. (Invited talk) ASME Workshop on Tolerancing and Metrology, University of North Carolina at Charlotte.
16. M. Smid and R. Janardan. On the width and roundness of a set of points in the plane, Proc. 7th. Canad. Conf. on Computational Geometry, 1995, pp. 193-198.
17. K. Swanson, D. T. Lee, and V. L. Wu. An optimal algorithm for roundness determination of convex polygons. Comput. Geom. Theory Appl. 5 (1995), 225-235.
18. A. D. Wainstein. A non-monotonous placement problem in the plane. Software systems for solving optimal planning problems. Abstracts, 9th All-Union Symp., Minsk, BSSR, 1986, pp. 70-71.
19. C. K. Yap. Exact computational geometry and tolerancing metrology. In Snapshots on Computational Geometry, Vol. 3, D. Avis and P. Bose (eds.). McGill School of Computer Science, 1994, pp. 34-48.