A NEW APPROACH TO POLYGONAL-APPROXIMATION

被引:16
作者
RAY, BK
RAY, KS
机构
[1] Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta, 700035
关键词
POLYGONAL APPROXIMATION;
D O I
10.1016/0167-8655(91)90036-L
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A new technique for polygonal approximation is proposed. It is fast and simple. The vertices of the polygon are identified by considering the patterns exhibited by the first-order finite differences of boundary point data. The error of approximation in constructing the polygon is found to be within a certain bound.
引用
收藏
页码:229 / 234
页数:6
相关论文
共 6 条
[1]   SEGMENTATION OF PLANE CURVES [J].
PAVLIDIS, T ;
HOROWITZ, SL .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (08) :860-870
[2]  
PAVLIDIS T, 1977, IEEE T COMPUT, V26, P800, DOI 10.1109/TC.1977.1674918
[3]  
PAVLIDIS T, 1973, P 1ST INTL JOINT C P, V1, P396
[4]  
Pavlidis T., 1977, STRUCTURAL PATTERN R
[5]  
Pavlidis T., 1982, ALGORITHMS GRAPHICS
[6]  
Scarborough J.B., 1930, NUMERICAL MATH ANAL, Vfirst