A Survey of suboptimal polygonal approximation methods

Authors

  • Mangayarkarasi R. School of Information Technology and Engineering,VIT University,Vellore,Tamilnadu
  • Vanitha M. School of Information Technology and Engineering,VIT University,Vellore,Tamilnadu
  • Sakthivel R. School of Information Technology and Engineering,VIT University,Vellore,Tamilnadu
  • Dr. Bharanitharan K Assistant Professor Korea University

Keywords:

Polygonal approximation, Dominant point detection, Iterative merge

Abstract

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.

Downloads

Published

2023-05-20

How to Cite

R., M., M., V., R., S., & K, D. B. (2023). A Survey of suboptimal polygonal approximation methods. International Journal of Communication and Computer Technologies, 4(1), 40–45. Retrieved from https://ijccts.org/index.php/pub/article/view/78

Issue

Vol. 4 No. 1 (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of communication and computer Technologies

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.