基于Freeman链码的自由曲线直线逼近算法

Linear approximation algorithm of free curves based on Freeman chain code

提出一种简单而有效的直线逼近自由曲线算法。自由曲线轮廓采用Freeman链码描述,提出快速分割链码算法,得出逼近节点,从而准确地实现对曲线的逼近。此外,该方法不仅适用于直线、圆弧和非圆曲线,而且还适用于形状复杂,不能用初等解析函数直接表示的自由曲线。实验结果表明,该算法简单、快速、准确,并对自由曲线具有较好的逼近效果。

A simple and efficient algorithm of the linear approximation ot tree curves is proposect. Ln me paper, me contour of a free curve is described by Freeman chain code. A rapid segmentation algorithm of chain code is proposed so as to get the approximation nodes. Thus, a more accurate approximation of the curve can be achieved. In addition, this method can not only be applied to straight lines, arcs and non-circular curves, but also curves which have complex shape and can not be described by an explicit function. The experiment results show that the algorithm is simple, rapid, accurate, and free curves have good approximation.