Complete roundness classification procedure

Kurt Mehlhorn, Thomas C. Shermer, Chee K. Yap

Research output: Contribution to conferencePaperpeer-review

Abstract

We describe a roundness classification procedure, that is, a procedure to determine if the roundness of a planar object I is within some ε0 from an ideal circle. The procedure consists of a probing strategy and an evaluation algorithm working in a feedback loop. This approach of combining probing with evaluation is new in computational metrology. For several definitions of roundness, our procedure uses O(1/qual(I)) probes and runs in time O(1/qual(I)2). Here, the quality qual(I) of I measures how far the roundness of I is from the accept-reject criterion. Hence our algorithms are `quality sensitive'.

Original languageEnglish (US)
Pages129-138
Number of pages10
StatePublished - 1997
EventProceedings of the 1997 13th Annual Symposium on Computational Geometry - Nice, Fr
Duration: Jun 4 1997Jun 6 1997

Other

OtherProceedings of the 1997 13th Annual Symposium on Computational Geometry
CityNice, Fr
Period6/4/976/6/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Complete roundness classification procedure'. Together they form a unique fingerprint.

Cite this