A technique to determine optimal polygons of digital curves is proposed. It determines the longest possible line segments with the minimum possible error. The L1 norm is used to measure the closeness of a polygon to a digital curve. The algorithm runs in linear time. The procedure is applied to several digital curves and promising results are obtained. © 1993.