ABSTRACT
We have developed a series of algorithms for polygonal approximation of closed digital curves. The problem has been treated as the side detection as well as angle detection problem.
The split and merge technique introduced in Chapter 2 resolves the problem of initial segmentation. The initial segmentation technique is simpler than that of the Ansari-Delp algorithm [6] as it requires less number of arithmetic operations than that of Ansari-Delp. The procedure has been tested with a number of digital curves. The experimental results have been compared with the Ansari-Delp algorithm and have been found to produce more accurate results.
