Issue No. 03 - March (1991 vol. 13)

ISSN: 0162-8828

pp: 217-223

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.75510

ABSTRACT

<p>The properties and computation of the minimum radial separation (MRS) standard for out-of-roundness are discussed. Another standard out-of-roundness measurement called the minimum area difference (MAD) center is introduced. Although the two centers have different characteristics, the approach to finding both centers shares many commonalities. An O(n log n+k) time algorithm which is used to compute the MRS center is presented. It also computes the MAD center of a simple polygon G, where n is the number of vertices of G, and k is the number of intersection points of the medial axis and the farthest-neighbor Voronoi diagram of G. The relationship between MRS and MAD is discussed.</p>

INDEX TERMS

computational geometry; minimum area difference centre; minimum radial separation; out-of-roundness; polygon; intersection points; medial axis; farthest-neighbor Voronoi diagram; computational geometry

CITATION

V.B. Le, D.T. Lee, "Out-of-Roundness Problem Revisited",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 13, no. , pp. 217-223, March 1991, doi:10.1109/34.75510CITATIONS