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

基于松弛迭代的快速路网平衡网格化算法
引用本文:陈云.基于松弛迭代的快速路网平衡网格化算法[J].测绘与空间地理信息,2014(5):103-106.
作者姓名:陈云
作者单位:厦门精图信息技术股份有限公司,福建厦门361008
摘    要:网格化划分算法是一种道路数据预处理方法,但网格剖分均衡度和耗时之间存在矛盾。为了解决此矛盾,本文借鉴了平衡二叉树的思想,基于松弛迭代方法,动态自适应确定松弛因子,建立了一个数学模型,提出了一种将道路路网快速平衡网格化划分的算法。文章实现了算法并在实际数据中进行测试,验证了算法的可行性和模型的正确性,同时也验证了该方法的有效性。

关 键 词:平衡二叉树  网格化  智能交通系统  松弛迭代方法

Rapid Equilibrium Network Grid Algorithm Based on Relaxation Iteration
CHEN Yun.Rapid Equilibrium Network Grid Algorithm Based on Relaxation Iteration[J].Geomatics & Spatial Information Technology,2014(5):103-106.
Authors:CHEN Yun
Institution:CHEN Yun ( Xiamen KINGTOP Information Technology Co. , Ltd. , Xiamen 361008, China)
Abstract:Grid partition algorithm is a kind of road data pretreatment methods,but data preprocessing method precision and decomposing the contradiction between the time-consuming. In order to solve this contradiction,this paper puts algorithm for rapid gridding of balance road network that draws on the concept of balanced binary tree and based on unequal step length created a mathematical model. The paper test verified the feasibility of the algorithm and model in the realization of the actual data,also verify the effectiveness of the proposed method.
Keywords:balanced binary tree  gridding  intelligent traffic system  SOR
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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