An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves
详细信息 查看全文
- 作者：F.J. Madrid-Cuevas ; fjmadrid@uco.es" class="auth_mail" title="E-mail the corresponding author ; E.J. Aguilera-Aguilera ; A. Carmona-Poyato ; R. Muñ ; oz-Salinas ; R. Medina-Carnicer ; N.L. Ferná ; ndez-Garcí ; a
- 关键词：Closed digital planar curve ; Polygonal approximation ; Split-merge ; Convex hull
- 刊名：Journal of Visual Communication and Image Representation
- 出版年：2016
- 出版时间：August 2016
- 年：2016
- 卷：39
- 期：Complete
- 页码：152-163
- 全文大小：1278 K
文摘
- •
Approximations with the best balance between fidelity and efficiency are automatically obtained.
- •
The method has no parameter to be set.
- •
The method has an moderate algorithmic complexity (among
and O(N2)).