Fitting a set of points by a circle

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fitting a set of points by a circle

Full text

Pdf (922 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents

Nice, France

Pages: 139 - 146

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Jesús García-López	Dpto. Matemática Aplicada, E.U. Informática, U. Politécnica de Madrid
Pedro A. Ramos	Dpto. Matemática Aplicada, E.U.I.T. Aeronaútica, U. Politécnica de Madrid

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 35, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.262919 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Pankaj K. Agarwal , Micha Sharir , Sivan Toledo, Applications of parametric searching in geometric optimization, Journal of Algorithms, v.17 n.3, p.292-318, Nov. 1994
	2	A. Aggarwal , L. J. Guibas , J. Saxe , P. W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete & Computational Geometry, v.4 n.6, p.591-604, Sep. 1989 [doi>10.1007/BF02187749]
	3	H. Ebara, N. Fukuyama, H. Nakano, Y. Nakanishi: Roundness algorithms using Voronoi diagrams, Abstracts 1st Canadian Conference on Computational Geometry, 1989.
	4	Herbert Edelsbrunner , Lionidas J Guibas , Jorge Stolfi, Optimal point location in a monotone subdivision, SIAM Journal on Computing, v.15 n.2, p.317-340, May 1986 [doi>10.1137/0215023]
	5	L. W. Foster: GEO-METRICS H: The application of geometric tolerancing techniques. Addison-Wesley Publishing Co., 1982.
	6	Van-Ban Le , D. T. Lee, Out-of-Roundness Problem Revisited, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.3, p.217-223, March 1991 [doi>10.1109/34.75510]
	7	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	8	T. J. Rivlin: Approximation by circles, Computing Vol. 21, pp. 93-104, 1979.
	9	U. Roy, X. Zhang: Establishment of a pair of concentric circles with the minimum radial separation for assessing rounding error, Computer Aided Design, Vol. 24(3), pp. 161-168, 1992.
	10	T. Shermer, C. K. Yap: Probing for nearcenters and approximate relative roundness, June 21-23, 1995. (invited talk) ASME Workshop on Tolerancing & Metrology, University of North Carolina at Charlotte.
	11	M. Srnid, R. Janardan: On the width and roundness of a set of points in the plane, Proc. 7th. Canadian Conference on Computational Geometry, pp. 193-198, 1995.
	12	Kurt Swanson , D. T. Lee , Vanban L. Wu, An optimal algorithm for roundness determination on convex polygons, Computational Geometry: Theory and Applications, v.5 n.4, p.225-235, Nov. 1995 [doi>10.1016/0925-7721(95)00004-6]
	13	C. K. Yap: Exact Computational Geometry and Tolerancing Metrology, Snapshots on Computational Geometry, Vol. 3, D. Avis and J. Bose (Eds.), McGill School of Computer Science, Tech. Rep. No. SOCS-94.50, 1994.

CITED BY 4

	Kurt Mehlhorn , Thomas C. Shermer , Chee K. Yap, A complete roundness classification procedure, Proceedings of the thirteenth annual symposium on Computational geometry, p.129-138, June 04-06, 1997, Nice, France
	Pedro A. Ramos, Computing roundness is easy if the set is almost round, Proceedings of the fifteenth annual symposium on Computational geometry, p.307-315, June 13-16, 1999, Miami Beach, Florida, United States
	Pankaj K. Agarwal , Boris Aronov , Sariel Har-Peled , Micha Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proceedings of the fifteenth annual symposium on Computational geometry, p.380-389, June 13-16, 1999, Miami Beach, Florida, United States
	Pankaj K. Agarwal , Micha Sharir, Efficient algorithms for geometric optimization, ACM Computing Surveys (CSUR), v.30 n.4, p.412-458, Dec. 1998