An algorithm for detection of dominant points and polygonal approximation of digitized curves

Abstract A new technique for the detection of dominant points and polygonal approximation of digitized curves is proposed. The procedure needs no input parameter and remains reliable even when features of multiple size are present. Unlike the existing algorithms, the present technique introduces the concept of an asymmetric region of support and k - l -cosine. The dominant points are the local maxima of k - l -cosine. The polygon is obtained joining the dominant points successively.