This paper presents a technique that uses distance to a point as a metric to measure the collinearity to delete quasi linear points on a digital curve. The technique described here iteratively deletes points whose deviation is minimal from the line segment joining its neighbours. The results of the proposed technique are compared with recent iterative point elimination techniques. The comparative results show that the proposed technique produces the polygon by preserving the significant vertices such as sharp turning, with less approximation error.