Given N ordered points in the plane and a constant M < N, an efficient
algorithm is proposed to find M points, among those given, which defi
ne a polygonal curve that is a globally optimal approximation.to the g
iven points. The algorithm accommodates any properly defined error mea
sure and the use of the most popular of these measures is studied in d
etail to maximize the computational efficiency. Experiments are report
ed showing the performance and usefulness of the proposed method.