Piecewise linear approximation of plane curves by perimeter optimization

Citations of this article
Mendeley users who have this article in their library.
Get full text


A method for the piecewise linear approximation of a plane curve is described. An approximate curve is obtained by choosing a certain number of points from a set of sampled points of the original curve. A "point choice function" that represents the relation between the original points and the chosen points is formulated. The approximation is performed by the dynamic programming principle searching for the optimal point choice function that attains the minimal error about arc length of the curve. Evaluation of the global approximate error provides efficient curve approximations, irrespective of shape complexity, number of sampled points, and irregularity of sampling interval. © 1992.




Sato, Y. (1992). Piecewise linear approximation of plane curves by perimeter optimization. Pattern Recognition, 25(12), 1535–1543. https://doi.org/10.1016/0031-3203(92)90126-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free