A NEW SPLIT-AND-MERGE TECHNIQUE FOR POLYGONAL-APPROXIMATION OF CHAIN CODED CURVES

In all split-and-merge techniques the fundamental problem is the initi al segmentation. In this paper the initial segmentation is done by int roducing the concept of rank of a point. The split-and-merge is done u sing two criteria functions, namely, the ratio of the arc length to th e length of the line segment and the ratio of the distance from a poin t to the line segment (not the perpendicular distance) to the length o f the line segment. The procedure generates polygons that are insensit ive to rotation and scales and remains reliable in presence of noise.