A data reduction algorithm for planar curves

A planar curve may be represented by a sequence of connected line segments. Existent algorithms for reducing the number of line segments used to represent a curve are examined. An efficient (linear time), computationally simple algorithm is developed. This algorithm achieves a high degree of data reduction while producing a representation that is accurate for even the most complex curves.