A Practical Algorithm for Computing the Roundness

Hiroyuki EBARA  Noriyuki FUKUYAMA  Hideo NAKANO  Yoshiro NAKANISHI  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E75-D   No.3   pp.253-257
Publication Date: 1992/05/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Algorithm and Computational Complexity
Keyword: 
computational geometry,  roundness,  computational experience,  

Full Text: PDF(428.6KB)>>
Buy this Article




Summary: 
Roundness is one of the most important geometric measures for circular objects in the process of mechanical assembly. It is the amount of variation in a circular size which can be permitted. To compute roundness, the authors have already proposed an exact polynomial-time algorithm whose time complexity is O(n2). In this paper, we show that this roundness algorithm can be improved more efficiently, by introducing the deletion of the unnecessary points, in practical applications. In addition, the computational experience of this revised algorithm is also presented.