Dynamic two-strip algorithm in curve fitting

作者:

Highlights:

摘要

In this paper, a new dynamic strip algorithm for fitting a curve with lines is presented. The algorithm first finds the best fitted left-hand side and right-hand side strips at each point on the curve. A figure of merit is computed based on the fitting results. Then, a local maximum detection process is applied to pick out points of high curvature. The approximated curve is one with the high curvature points connected by straight lines. The global structure of a shape, which is insensitive to a scale and orientation changes, is obtained by merging the results from several runs of the algorithm with different minimum strip widths.

论文关键词:Angle measurement,Corner,Curvature,Curve fitting,Data compression,Line fitting,Polygonal approximation,Strip algorithm

论文评审过程:Received 5 December 1988, Revised 2 March 1989, Available online 19 May 2003.

论文官网地址:https://doi.org/10.1016/0031-3203(90)90049-Q