### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual Symposium on Computational Geometry |

Editors | Anon |

Publisher | ACM |

Pages | 129-138 |

Number of pages | 10 |

State | Published - 1997 |

Event | Proceedings of the 1997 13th Annual Symposium on Computational Geometry - Nice, Fr Duration: Jun 4 1997 → Jun 6 1997 |

### Other

Other | Proceedings of the 1997 13th Annual Symposium on Computational Geometry |
---|---|

City | Nice, Fr |

Period | 6/4/97 → 6/6/97 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*Proceedings of the Annual Symposium on Computational Geometry*(pp. 129-138). ACM.

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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

AN - SCOPUS:0030679921

SP - 129

EP - 138

BT - Proceedings of the Annual Symposium on Computational Geometry

A2 - Anon, null

PB - ACM

ER -