期刊名称：International Journal of Communication and Computer Technologies
印刷版ISSN：2278-9723
出版年度：2016
卷号：4
期号：1
页码：40-45
DOI：10.31838/ijccts/04.01.07
语种：English
出版社：IJCCTS
摘要：Polygonal approximation detects a set of feature points on the boundary of a shape that constitute the vertices of the shape. In particular, shape representation by polygonal approximation has become a popular technique due to its easiness, locality and compression. This paper presents a survey of methods that detects a set of dominant points that constitute the boundary of a 2D digital planar curve with an iterative procedure and a comparison of the polygonal approximation algorithms on various shapes with varying number of dominant points is made along with the demerits of each of the techniques.
关键词：Polygonal approximation;Dominant point detection;point detection;Iterative merge
