检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李成名[1,2] 郭沛沛[1,2] 殷勇[1,2] 武鹏达 顾腾[3]
机构地区:[1]山东科技大学测绘科学与工程学院,山东青岛266590 [2]中国测绘科学研究院,北京100830 [3]东华理工大学测绘工程学院,江西南昌330013
出 处:《测绘学报》2017年第4期498-506,共9页Acta Geodaetica et Cartographica Sinica
基 金:国家科技支撑计划(2015BAJ06B01);测绘地理信息公益性行业科研专项(201512027);国家基础测绘项目(A1615)~~
摘 要:线要素化简在制图表达与综合领域一直是研究的热点和难点之一。然而,经典化简算法多针对单独线要素进行处理,缺乏对该线要素与周边线要素之间整体空间关系的考虑,并且,存在计算结果生硬(D-P算法)、局部极值点缺失,特别是在曲度较大之处出现相交异常(L-O算法)等问题。为此,本文提出一种顾及空间关系约束的线化简算法,建立线要素全局化简方法(LGSM)和矢量位移、面积位移等5类评价指标。采用等高线、河流和道路3类线要素实际数据进行了试验,充分检验了本文算法的优越性,其处理结果符合开方根模型规律,降低了曲线复杂度,在保证全局空间关系不变条件下,不仅更好地保持了曲线整体形状特征,而且光滑美观、精度高。Line element simplification has always been a hot research topic in the field of cartography generalization and expression.However,more existing line simplification algorithms aimed at single line rather than spatial relationship between linear elements.At the same time,there are some problems with classical algorithm,such as blunt performance(D-P algorithm),missing local extreme point and curve intersection(L-O algorithm).So,this paper puts forward a line simplification algorithm taking account of spatial relations between two lines.Line global simplification method(LGSM),vector displacement,area displacement and so on are proposed.Experiments are carried out on three kinds of line elements,such as contour lines,rivers and roads.The experiments' results show that the proposed algorithm can maintain the overall shape of the curve better and reduce the complexity of the curve effectively,the shape is more smooth and has a high position accuracy.
分 类 号:P208[天文地球—地图制图学与地理信息工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3