快速无监督曲线多边形逼近，兼顾速度与视觉美观。
A Fast Unsupervised Scheme for Polygonal Approximation
- 三阶段流程：初分割、迭代加点、合并调优
- 比现有方法更快，且在罗辛度量下表现优异
- 适合需要高效曲线简化与美观输出的场景
本文提出一种快速无监督的闭合数字曲线多边形逼近方法。该方法包含三个阶段：初始分割、迭代顶点插入、迭代合并及顶点调整。初始分割用于检测高曲率拐点；因低曲率重要顶点可能遗漏，故通过迭代插入补充缓慢但稳定变化区域的顶点；初始阶段可能引入冗余点，因此采用合并机制去除；最后通过顶点调整提升逼近结果的视觉美感。使用罗辛方法评估逼近质量，实验表明该方法在几何变换下具有鲁棒性，且计算效率优于当前主流方法。
原文摘要 · Abstract (English)
This paper proposes a fast and unsupervised scheme for the polygonal approximation of a closed digital curve. It is demonstrated that the approximation scheme is faster than state-of-the-art approximation and is competitive with Rosin's measure and aesthetic aspects. The scheme comprises of three phases: initial segmentation, iterative vertex insertion, iterative merging, and vertex adjustment. The initial segmentation is used to detect sharp turns, that is, vertices that seemingly have high curvature. It is likely that some of the important vertices with low curvature might have been missed in the first phase; therefore, iterative vertex insertion is used to add vertices in a region where the curvature changes slowly but steadily. The initial phase may pick up some undesirable vertices, and thus merging is used to eliminate redundant vertices. Finally, vertex adjustment was used to enhance the aesthetic appearance of the approximation. The quality of the approximations was measured using the Rosin's method. The robustness of the proposed scheme with respect to geometric transformation was observed.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。