计算机工程与应用2009，Vol.45Issue(32)：189-192,4.DOI:10.3778/j.issn.1002-8331.2009.32.060
Douglas-Peucker算法在无拓扑矢量数据压缩中的改进
Improvement on Douglas-Peucker algorithm for non-topolog3, vector data
摘要
Abstract
The paper analyzes the reason of graphic distortion phenomenon when compressing the non-topology vector graphics by classical Douglas-Peucker algorithm.The reason is that the common boundary is compressed with Douglas-Peucker algorithm more than one time.Based on this,an improvement on Douglas-Peucker named common boundary objected Douglas-Peucker improving algorithm is put forward.To implement it,first this paper designs a new algorithm for extracting common boundary between two polygons.Then it adopts the idea of OOP,packages the common boundary to be a class with other information showed in figure two.Finally,on the basis of the class,it applies classical Douglas-Peucker to the common boundary and non-common boundary of polygons respectively to compress vector graphics.At last,the validity of the new compressing algorithm is proved by experiment with SVG graph.And the advantages in space and time efficiency are analyzed by contrast with the other DouglasPeucker improving algorithm showed in table one and two.关键词
Douglas-Peucker算法/矢量数据压缩/可缩放矢量图形(SVG)/公共边对象化Douglas-Peucker改进算法Key words
Douglas-Peucker algorithm/vector data compressing/Scalable Vector Graphies(SVG)/common boundary objected Douglas-Peucker improving algorithm分类
信息技术与安全科学引用本文复制引用
谢亦才,李岩..Douglas-Peucker算法在无拓扑矢量数据压缩中的改进[J].计算机工程与应用,2009,45(32):189-192,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60842007) （the National Natural Science Foundation of China under Grant No.60842007）
广东省百项工程项目(No.2005830801006). （No.2005830801006）
