A complete roundness classification procedure

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A complete roundness classification procedure

Full text

Pdf (1.00 MB)

Source

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

Nice, France

Pages: 129 - 138

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Kurt Mehlhorn	Max-Planck-Institute für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
Thomas C. Shermer	School of Computing Science, Simon Fraser University, Burnaby, B.C. V5A 1S6, Canada
Chee K. Yap	Courant Institute of Mathematical Sciences, New York University, New York, NY

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): 5, Downloads (12 Months): 24, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

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.262917 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	Richard Cole , Chee K. Yap, Shape from probing, Journal of Algorithms, v.8 n.1, p.19-38, March 1987 [doi>10.1016/0196-6774(87)90025-3]
	2	Christian A. Duncan , Michael T. Goodrich , Edgar A. Ramos, Efficient approximation and optimization algorithms for computational metrology, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.121-130, January 05-07, 1997, New Orleans, Louisiana, United States
	3	H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi. Roundness algorithms using the Voronoi diagrams. In Abstracts 1st Canad. Conf. Comput. Geom., page 41, 1989.
	4	Shaw C. Feng and Theodore H. Hopp. A review of current geometric tolerancing theories and inspection data analysis algorithms. Technical Report NISTIR-4509, National Institute of Standards and Technology, U.S. Department of Commerce. Factory Automation Systems Division, Gaithersburg, MD 20899, February 1991.
	5	A. B. Forbes. Geometric tolerance assessment. NPL Technical Report DITC 210/92, National Physical Laboratory, Division of Information Technology and Computing, NPL, Teddington, Middlesex, U.K. TW 11 0LW, October, 1992.
	6	Jesús García-López , Pedro A. Ramos, Fitting a set of points by a circle, Proceedings of the thirteenth annual symposium on Computational geometry, p.139-146, June 04-06, 1997, Nice, France [doi>10.1145/262839.262919]
	7	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]
	8	S. D. Phillips, B. Borchardt, and G. Caskey. Measurement uncertainty considerations for coordinate measuring machines. NIST Technical Report NISTIR 5170, National Institute of Standards and Technology, NIST, Precision Engineering Division, Building 220, Room B ll 3, Gaithersburg, MD 20899, April, 1993.
	9	U. Roy, C.R. Liu, and T.C. Woo. Review of dimensioning and tolerancing: representation and processing. Computer-aided Design, 23(7):466-483, 1991.
	10	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): 161-168, 1992.
	11	Michiel Smid and Ravi Janardan. On the width and roundness of a set of points in the plane. Department of Computer Science Report TR 94-62, University of Minnesota, 1994.
	12	Vijay Srinivasan and Herbert B. Voelcker, editors. Dimensional Tolerancing and Metrology, 345 East 47th Street, New York, NY 10017, 1993. The American Society of Mechanical Engineers. CRTD-Vol. 27.
	13	Kurt Swanson, An Optimal Algorithm for Roundness Determination on Convex Polygons, Proceedings of the Third Workshop on Algorithms and Data Structures, p.601-609, August 11-13, 1993
	14	Chee K. Yap. Exact computational geometry and tolerancing metrology. In David Avis and Jit Bose, editors, Snapstu#ts of Computational and Discrete Geometry, VoL3. McGill School of Comp.Sci, Tech.Rep. No.SOCS-94.50, 1994. A Volume Dedicated to Godfried Toussaint.
	15	Chee K. Yap and Ee-Chien Chang. Issues in the metrology of geometric tolerancing. In M. Overmars, editor, Proc. Workshop on Algorithmic Robotics. Springer Verlag, 1996. (to appear) Lecture Notes in Computer Science.

CITED BY 5

	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
	Deepak Bandyopadhyay , Jack Snoeyink, Almost-Delaunay simplices: nearest neighbor relations for imprecise points, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
	Ravi Kumar , D. Sivakumar, Roundness estimation via random sampling, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.603-612, January 17-19, 1999, Baltimore, Maryland, United States