| 压缩矢量图形的两个算法的比较和分析 |
| |
| 引用本文： | 喻国宝,廖湖声,郑玉明. 压缩矢量图形的两个算法的比较和分析[J]. 计算机工程与应用, 2005, 41(1): 80-81,209 |
| |
| 作者姓名： | 喻国宝 廖湖声 郑玉明 |
| |
| 作者单位： | 北京工业大学计算机学院,北京,100022;北京工业大学计算机学院,北京,100022;北京工业大学计算机学院,北京,100022 |
| |
| 基金项目： | 北京市教委科技发展基金(编号:KM200410005005)，北京市优秀人才培养专项经费资助 |
| |
| 摘 要： | 文章在介绍矢量图形压缩的意义后,分别介绍了矢量图形压缩的分治算法和线性算法,并对这两个算法进行了分析和比较。在选取适当的控制数据压缩的阈值后,分治算法和线性算法的压缩效果接近,但线性算法所需存储空间比分治算法的少,而且线性算法的时间复杂度从分治算法的O(nlogn)降低到O(n)。
|
| 关 键 词： | 地理信息系统 矢量图形压缩 算法分析 |
| 文章编号： | 1002-8331-(2005)01-0080-02 |
Comparison and Analysis of Two Compact Algorithms for Vector Graph |
| |
| Yu Guobao,Liao Husheng,Zheng Yuming. Comparison and Analysis of Two Compact Algorithms for Vector Graph[J]. Computer Engineering and Applications, 2005, 41(1): 80-81,209 |
| |
| Authors: | Yu Guobao Liao Husheng Zheng Yuming |
| |
| Abstract: | After introducing the purpose of vector graph compact,a Divide-and-Conquer algorithm and a linear algorithm for vector graph compact are described in this paper.Comparison and analysis are also discussed,revealing that the linear algorithm has approximate same effectiveness as the Divide-and-Conquer algorithm but the linear algorithm has the time complexity of O(n) whereas the Divide-and-Conquer algorithm has the time complexity of O(nlogn).Moreover,the linear algorithm needs less memory than the Divide-and-Conquer algorithm. |
| |
| Keywords: | Geographic Information Systems vector graph compact algorithm analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
