| 基于凸包的线状要素化简的一种改进算法 |
| |
| 引用本文： | 詹自熬.基于凸包的线状要素化简的一种改进算法[J].河南科学,2009,27(12):1555-1558. |
| |
| 作者姓名： | 詹自熬 |
| |
| 作者单位： | 河南工程学院,郑州,451191 |
| |
| 基金项目： | 河南省科学技术厅科技发展基金项目 |
| |
| 摘 要： | 提出了一种线状要素化简的Douglas-Peucker算法的改进算法，利用求解路径凸包的策略查找Douglas-Peucker算法中的分裂点，有效地提高了Douglas-Peucker算法核心部分的效率，改进算法降低了Douglas-Peucker算法的时间复杂度．
|
| 关 键 词： | 线状要素化简 Douglas-Peucker算法 路径凸包 |
The Accelerated Algorithm of Line Simplification Based on the Path Hull |
| |
| Zhan Ziao.The Accelerated Algorithm of Line Simplification Based on the Path Hull[J].Henan Science,2009,27(12):1555-1558. |
| |
| Authors: | Zhan Ziao |
| |
| Institution: | Zhan Ziao (Henan Institute of Engineering, Zhengzhou 451191, China) |
| |
| Abstract: | The Douglas-Peucker algorithm is a classic way of line simplification.But the speed is not enough satisfied.So there is the need for improving the efficiency.The accelerated algorithm reduces the time cost by seeking the split vertex through the path hull. |
| |
| Keywords: | line simplification the Douglas-Peucker path hull |
| 本文献已被 维普 万方数据 等数据库收录！ |
