Complete roundness classification procedure

Kurt Mehlhorn, Thomas C. Shermer, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Editors Anon
PublisherACM
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

Fingerprint

Roundness
Feedback
Evaluation
Feedback Loop
Metrology
Circle
Probe

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

Mehlhorn, K., Shermer, T. C., & Yap, C. (1997). Complete roundness classification procedure. In Anon (Ed.), Proceedings of the Annual Symposium on Computational Geometry (pp. 129-138). ACM.

Complete roundness classification procedure. / Mehlhorn, Kurt; Shermer, Thomas C.; Yap, Chee.

Proceedings of the Annual Symposium on Computational Geometry. ed. / Anon. ACM, 1997. p. 129-138.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mehlhorn, K, Shermer, TC & Yap, C 1997, Complete roundness classification procedure. in Anon (ed.), Proceedings of the Annual Symposium on Computational Geometry. ACM, pp. 129-138, Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, 6/4/97.
Mehlhorn K, Shermer TC, Yap C. Complete roundness classification procedure. In Anon, editor, Proceedings of the Annual Symposium on Computational Geometry. ACM. 1997. p. 129-138
Mehlhorn, Kurt ; Shermer, Thomas C. ; Yap, Chee. / Complete roundness classification procedure. Proceedings of the Annual Symposium on Computational Geometry. editor / Anon. ACM, 1997. pp. 129-138
@inproceedings{3357d09db9f543eb803602b3f7d21a3c,
title = "Complete roundness classification procedure",
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'.",
author = "Kurt Mehlhorn and Shermer, {Thomas C.} and Chee Yap",
year = "1997",
language = "English (US)",
pages = "129--138",
editor = "Anon",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
publisher = "ACM",

}

TY - GEN

T1 - Complete roundness classification procedure

AU - Mehlhorn, Kurt

AU - Shermer, Thomas C.

AU - Yap, Chee

PY - 1997

Y1 - 1997

N2 - 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'.

AB - 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'.

UR - http://www.scopus.com/inward/record.url?scp=0030679921&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030679921&partnerID=8YFLogxK

M3 - Conference contribution

SP - 129

EP - 138

BT - Proceedings of the Annual Symposium on Computational Geometry

A2 - Anon, null

PB - ACM

ER -