| Stroke特征约束的树状河系层次关系构建及简化方法 |
| |
| 引用本文： | 李成名,殷勇,吴伟,武鹏达.Stroke特征约束的树状河系层次关系构建及简化方法[J].测绘学报,2018,47(4):537-546. |
| |
| 作者姓名： | 李成名 殷勇 吴伟 武鹏达 |
| |
| 作者单位： | 1. 山东科技大学测绘科学与工程学院, 山东 青岛 266590;
2. 中国测绘科学研究院, 北京 100830 |
| |
| 基金项目： | 国家科技支撑计划(2015BAJ06B01),测绘地理信息公益性行业科研专项(201512020 |
| |
| 摘 要： | 树状河系作为地图骨干要素之一,其简化效果直接决定地图综合的质量。树状河系简化需要考虑其语义、几何、拓扑和结构等多种特征,而现有方法大多只注重了长度、角度和属性等约束性量化指标,致使简化后的空间分布特征容易被破坏。本文首先研究基于树状河系有向拓扑树（DTT）的特征智能识别方法,然后依据Paiva提出的"180°假设"和"锐角假设",从河口出发,自下游向上游建立顾及河流语义、长度、角度约束的树状河系stroke连接,并据此判断树状河系层次关系,最后提出河系整体选取数量确定方法和顾及密度差异的河系分层剔除选取算法,实现树状河系自动化简化。经样本数据测试,验证了该方法的可靠性,同时经实际数据测试,验证了该方法在树状河系简化中的合理性和有效性。
|
| 关 键 词： | 河系简化 树状河系stroke特征约束 密度差异 空间结构特征 分层剔除选取 |
| 收稿时间： | 2017-03-22 |
| 修稿时间： | 2018-01-05 |
Method of Tree-like River Networks Hierarchical Relation Establishing and Generalization Considering Stroke Properties |
| |
| LI Chengming,YIN Yong,WU Wei,WU Pengda.Method of Tree-like River Networks Hierarchical Relation Establishing and Generalization Considering Stroke Properties[J].Acta Geodaetica et Cartographica Sinica,2018,47(4):537-546. |
| |
| Authors: | LI Chengming YIN Yong WU Wei WU Pengda |
| |
| Institution: | 1. College of Geomatics, Shandong University of Science and Technology, Qingdao 266590, China;
2. Chinese Academy of Surveying and Mapping, Beijing 100830, China |
| |
| Abstract: | Tree-like river is one of the key features of map,its simplification effect determines the quality of cartography generalization directly.Simplifying tree-like river need to be considered many characteristics, such as semantic,geometry,topology and structure,but the traditional methods only focus on the quantitive indexes,such as length,angle,which lead to the spatial distribution characteristics of the simplified results were destroyed easily.A new method based on the stroke properties is presented.Firstly,the intelligent identification method of characteristics is studied in this paper on the basis of directed topological tree (DTT).Secondly,according to"180° hypothesis"and"acute hypothesis"which proposed by Paiva and stroke properties,the hierarchical rel ationship for tree-like river network is established.Finally,the algorithms for setting the whole numbers and hierarchical elimination selection were proposed to realize the automatic simplification of tree river.Results from sample data test verify the reliability and results from actual data verify the rationality and effectiveness of the proposed method. |
| |
| Keywords: | |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《测绘学报》浏览原始摘要信息 |
| 点击此处可从《测绘学报》下载免费的PDF全文 |
|
