| 道路网络示意图的多边形生长算法 |
| |
| 引用本文： | 张蓝,李佳田,徐珩,贺飞越,徐燕竹,王红梅.道路网络示意图的多边形生长算法[J].测绘学报,2015,44(3):346-352. |
| |
| 作者姓名： | 张蓝 李佳田 徐珩 贺飞越 徐燕竹 王红梅 |
| |
| 作者单位： | 昆明理工大学国土资源工程学院, 云南 昆明 650093 |
| |
| 基金项目： | 国家自然科学基金(41161061;40901197)~~ |
| |
| 摘 要： | 道路网络示意图是实体网络的抽象表示,因其更加符合人的认知习惯,在地图服务与地图制图领域已得到初步应用。以路径为单位的网络示意图自动生成算法只顾及节点与线段的局部布置,且较难以维护网络拓扑一致性。本文以闭合多边形(网眼)为基本单位,利用网眼的独立性与邻接性,提出了多边形生长算法,核心思想是将道路网络分类为闭合多边形与非闭合线段,以闭合多边形提取、映射、优化为主线,辅助组合非闭合线段。算例分析验证,本算法在网络均衡分布及拓扑一致性方面具有优势。
|
| 关 键 词： | 网络示意图 网眼 闭合多边形 映射 算法 |
| 收稿时间： | 2014-01-03 |
| 修稿时间： | 2014-04-15 |
Polygon Growing Algorithm for Network Schematic Maps |
| |
| ZHANG Lan
,
LI Jiatian
,
XU Heng
,
HE Feiyue
,
XU Yanzhu
,
WANG Hongmei.Polygon Growing Algorithm for Network Schematic Maps[J].Acta Geodaetica et Cartographica Sinica,2015,44(3):346-352. |
| |
| Authors: | ZHANG Lan LI Jiatian XU Heng HE Feiyue XU Yanzhu WANG Hongmei |
| |
| Institution: | Faculty of Land Resource Engineering, Kunming University of Science and Technology, Kunming 650093, China |
| |
| Abstract: | Network schematic map is the abstract representation of entity network .It has been applied in the field of map service and cartography because it is more consistent with people’s cognitive habits .The previous route‐based auto schematic algorithms have only considered the local arrangement of nodes and are difficult to maintain topological consistency .In reaction to the deficiency , a new polygon‐based algorithm is proposed in this paper ,which uses the closed polygons (mesh) as the basic unit of the network for their independence and adj acency .The network is regarded as closed polygons and non‐closed line segments .The main progress is extracting ,mapping and combining closed polygons .Experimental analysis showsthatthisalgorithmismoreeffectiveinbalancingnetworkspatial distributionandmaintainingtopolo‐gi cal consi stency . |
| |
| Keywords: | network schematic maps mesh density closed polygon mapping algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《测绘学报》浏览原始摘要信息 |
| 点击此处可从《测绘学报》下载免费的PDF全文 |
|
