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

矢量化多边形优化方法
引用本文:金良益,江南,张亚军,范林林.矢量化多边形优化方法[J].测绘科学技术学报,2017,34(3).
作者姓名:金良益  江南  张亚军  范林林
作者单位:1. 信息工程大学,河南郑州,450001;2. 苏州中科蓝迪软件技术有限公司,江苏苏州,215009
摘    要:从地理空间数据不确定性理论出发,提出了矢量化多边形的优化方法。该方法通过对矢量多边形进行"磨角插值"和基于可接受域限定的自适应滤波平滑处理,以此来削弱由空间数据表示不确定性造成的误差,使矢量化多边形最大限度地逼近地理实体真实轮廓。采用基于全局阈值的DP算法进行压缩处理,消除了数据冗余。从压缩比、位置误差及处理效率3个方面进行对比实验,验证了所提方法的有效性。

关 键 词:矢量化多边形  优化  磨角插值  可接受域  平滑

Optimization of Polygon Represented by Vector
JIN Liangyi,JIANG Nan,ZHANG Yajun,FAN Linlin.Optimization of Polygon Represented by Vector[J].Journal of Zhengzhou Institute of Surveying and Mapping,2017,34(3).
Authors:JIN Liangyi  JIANG Nan  ZHANG Yajun  FAN Linlin
Abstract:Based on the uncertainty theory of geospatial data,an optimization method of vector polygon is proposed.In this method,vector polygons are smoothed by "grinding angle and interpolation" and adaptive filtering based on the acceptable domain,so as to weaken the errors caused by spatial data representation uncertainty and to maximize the approximation ofvector polygons to the true contours of geographic entities.The DP algorithm based on the global threshold is used to compress data which eliminates data redundancy.The effectiveness of the proposed method is verified from three aspects which are compression ratio,position error and processing efficiency.
Keywords:vector polygon  optimization  grinding angle and interpolation  acceptable domain  smoothing
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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