Indexed by:
Abstract:
文章在介绍矢量图形压缩的意义后,分别介绍了矢量图形压缩的分治算法和线性算法,并对这两个算法进行了分析和比较.在选取适当的控制数据压缩的阈值后,分治算法和线性算法的压缩效果接近,但线性算法所需存储空间比分治算法的少,而且线性算法的时间复杂度从分治算法的O(nlogn)降低到O(n).
Keyword:
Reprint Author's Address:
Email:
Source :
计算机工程与应用
ISSN: 1002-8331
Year: 2005
Issue: 1
Volume: 41
Page: 80-81,209
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count: 5
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: