| 一种快速有效的多边形逼近算法 |
| |
| 引用本文： | 李文德,许毓秋.一种快速有效的多边形逼近算法[J].中国空间科学技术,1993,13(5):55-60. |
| |
| 作者姓名： | 李文德 许毓秋 |
| |
| 作者单位： | 北京航空航天大学
(李文德)，北京控制工程研究所(许毓秋) |
| |
| 摘 要： | 提出一种新的多边形逼近算法。它结合了角度探测找优势点和分段最佳线性逼性找优势点两类算法特点，与其它同类算法比较具有输出优势点少，优势点位置准确，速度快等优点。
|
| 关 键 词： | 多边形 逼近 最佳算法 数据处理 |
A NEW FAST POLYGONAL LINEAR APPROXIMATION ALGORITHM |
| |
| Li Wende.A NEW FAST POLYGONAL LINEAR APPROXIMATION ALGORITHM[J].Chinese Space Science and Technology,1993,13(5):55-60. |
| |
| Authors: | Li Wende |
| |
| Institution: | Li Wende (Beijing University of Aeronautics and Astronautics)
Xu Yuqiu (Beijing Institute of Control Engineering) |
| |
| Abstract: | A new fast polygonal approximation algorithm is presented.Itcombines two techniques of dominant poinis detection algorithm by corner detection and polygonal approximation algorithm.By comparing the algorithm withother algorithms,it was found that the proposed algorithm has features of feweroutput dominant points more accurate positions of dominant points and higherspeed. |
| |
| Keywords: | Polyon Approximation Optimum algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
