作　　者： ; ; ;

机构地区： 华南师范大学计算机学院

出　　处： 《计算机应用与软件》 2010年第1期141-144,共4页

摘　　要： 分析常规Douglas-Peucker算法压缩无拓扑矢量数据时产生公共边"裂缝"现象的原因——公共边被两次或可能更多次压缩,而每次运用Douglas-Peucker算法压缩时所选择的初始点和终点不同造成的。为此,提出公共边对象化Douglas-Peucker改进算法。为实现此算法,首先设计了新的公共边提取算法来提取公共边,然后使用OOP技术,把公共边的相关信息封装成类,最后根据公共边对象提供的信息对多边形的公共边和非公共边分别进行Douglas-Peucker压缩。以广东省行政界线的SVG矢量图为实验对象验证了此算法的有效性,分析了本算法相对于其它Douglas-Peucker改进算法在所需辅助空间和时间效率上的优势。 The article analysed the reason of crack phenomenon on common boundary of graphics when compressing the non-topology vector graphics by conventional Douglas-Peucker algorithm-the common boundary might be compressed twice or more,whiles each compression with Douglas-Peucker algorithm selects different initial and end points.Therefore,an improved Douglas-Peucker algorithm to objectify the common boundary is put forward.To implement it,first,we design a new algorithm to extract the common boundaries between two polygons.Then we adopt OOP technology to encapsulate the information with regard to common boundaries to a class.And at last,on the basis of the class,we apply conventional Douglas-Peucker compression to vector graphics of the common boundary and non-common boundary of the polygons respectively according to the information provided by common boundary object.The validity of the new compressing algorithm is proved in an experiment with SVG vector graphics of the administrative boundary of Guangdong Province.And the advantages in auxiliary space and time efficiency this algorithm possesses is analysed in contrasting with other improved Douglas-Peucker algorithms.

关 键 词： 算法 矢量数据压缩 公共边对象化 改进算法

领　　域： [自动化与计算机技术] [自动化与计算机技术] [天文地球] [天文地球]