An algorithm for polygonal approximation of a digital object

Abstract A fast and simple heuristic algorithm for polygonal approximation is presented. The algorithm is based on a mark and sweep technique. Results of computer implementation with various images are reported.

[1]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[2]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[3]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[4]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..