OUT-OF-ROUNDNESS PROBLEM REVISITED

被引:47
作者
LE, VB [1 ]
LEE, DT [1 ]
机构
[1] NORTHWESTERN UNIV,DEPT ELECT ENGN & COMP SCI,EVANSTON,IL 60208
关键词
FARTHEST NEIGHBOR VORONOI DIAGRAM; MAXIMUM INSCRIBED CENTER; MEDIAL AXIS; MINIMUM AREA DIFFERENCE CENTER; MINIMUM CIRCUMSCRIBED CENTER; MINIMUM RADIAL SEPARATION CENTER; NEAREST NEIGHBOR VORONOI DIAGRAM; ONE-CIRCLE APPROXIMATION CENTER;
D O I
10.1109/34.75510
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The out-of-roundness measurement of a circular profile undertakes different schemes depending on the type of center specified. The most common standard recommended by the American National Standards Institute (ANSI) is the minimum radial separation center. In this paper, we introduce another standard, called the minimum area difference center. Although the two centers are different in characteristics, the approach to finding both centers shares many commonalities. We present an O(n log n + k) time algorithm to compute the minimum radial separation center, and the minimum area difference 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 (or the nearest neighbor Voronoi polygons of all skeleton region elements) and the farthest neighbor Voronoi diagram of G.
引用
收藏
页码:217 / 223
页数:7
相关论文
共 12 条
[11]  
TOUISSANT GT, 1983, INT J COMPUT INF SCI, V12, P347
[12]  
YAP CK, 1984, ONLOGN ALGORITHM VOR