首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于约束点的无拓扑多边形数据压缩算法
引用本文:吴正升,成毅,郭婧.基于约束点的无拓扑多边形数据压缩算法[J].测绘学院学报,2006(3).
作者姓名:吴正升  成毅  郭婧
作者单位:信息工程大学测绘学院 河南郑州450052
基金项目:测绘学院课题(Y0502)
摘    要:分析了常规压缩算法(如Douglas-Peucker算法)压缩无拓扑多边形数据会产生公共边界不一致现象,认为出现此现象的原因是多边形公共边界的压缩起始点选择不一致,进而提出了一种新的基于约束点的无拓扑多边形数据压缩算法。算法原理包括:首先将多边形公共边界的两个端点作为约束点处理,使得多边形从约束点处逻辑上分成几段;然后利用常规压缩算法进行分段压缩,使每一多边形公共边界的压缩初始点一致,从而保证了无拓扑多边形数据的一致性压缩;最后大量试验验证了此算法的有效性。

关 键 词:无拓扑数据  Douglas-Peucker算法  约束点  VCT

An Algorithm to Compress Non-Topology Polygon Data on the Constraint Points
WU Zheng-sheng,CHENG Yi,GUO Jing.An Algorithm to Compress Non-Topology Polygon Data on the Constraint Points[J].Journal of Institute of Surveying and Mapping,2006(3).
Authors:WU Zheng-sheng  CHENG Yi  GUO Jing
Abstract:This paper analyses the inconsistent common boundary that can be brought by using the general compression algorithms(for example Douglas-Peucker algorithm) to the non-topology polygon data,and considers that the reason of data distortion is the inconsistent choice of the compressed starting point for polygon common boundary.Then,a new method to compress the non-topology polygon data based on constraint points is put forward.The method includes the following steps.Firstly,the two end points of polygon common boundary are taken as constraint points,and then the polygon is divided into some parts at the constraint points logically.Secondly,the data is compressed piecewise by the general compression algorithm,in which the common boundary of polygon provides the consistency for the compressed starting point,and non-topology polygon data of consistent compression is obtained.Finally,the some experiments show that the proposed method is efficient.
Keywords:non-topology data  Douglas-Peucker algorithm  constraint points  VCT
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号