城市轨道交通三维缓冲区构建方法  

3Dbuffer zone creation method of urban rail transit

作　　者：张文胜[1,2] 解骞[1,2] 朱冀军[3] 张炳哲[3] 纪强[3] 李见春[4] 

机构地区：[1]石家庄铁道大学交通运输学院,河北石家庄050043 [2]石家庄铁道大学河北省交通安全与控制重点实验室,河北石家庄050043 [3]河北省交通规划设计院,河北石家庄050011 [4]悉尼科技大学土木与环境工程学院,新南威尔士悉尼2007

出　　处：《交通运输工程学报》2015年第2期100-108,共9页Journal of Traffic and Transportation Engineering

基　　金：国家自然科学基金项目(51308358);河北省交通科技项目(J-20130438);石家庄市科学技术研究与发展计划项目(137130086A,133130074A);北京铁路局科技研究开发计划项目(2014BY13)

摘　　要：为解决现有地理信息系统无法完成城市轨道交通三维缓冲区构建的难题,采用八叉树作为构建三维缓冲区的基础数据结构,用线性八叉树编码储存轨道交通实体的空间结构信息,将交通三维缓冲区分析转化为八叉树节点的空间分析。研究了八叉树节点的空间关系,得出了一种线性八叉树邻域分析的新算法,即0-1互换算法。运用0-1互换算法找出轨道交通的边界节点,确定边界节点的边界方向,由边界节点构建交通三维缓冲区,形成了一套由线性八叉树构建城市轨道交通三维缓冲区的新方法。运用0-1互换算法对直线隧道、曲线隧道、直线高架桥、曲线高架桥等轨道交通实体模型进行边界节点提取,并与传统算法和经典肖氏算法进行了比较。选择连拱隧道、单拱隧道和高架桥3种结构,分别进行了三维缓冲区构建,统计了3种结构分割的八叉树节点数量,并与采用传统栅格结构进行三维缓冲区分析的栅格节点数量进行对比。分析结果表明:与传统算法和经典肖氏算法相比,0-1互换算法在对直线隧道、曲线隧道、直线高架桥、曲线高架桥4种轨道交通实体模型的边界节点提取中耗时最少,分别为5、7、10、18ms,将算法的时间复杂度由二次阶减少为一次阶;基于线性八叉树的交通三维缓冲区构建方法,对连拱隧道、单拱隧道与高架桥进行三维缓冲区构建时,其存储空间分别为栅格结构的7.26%、3.64%、3.72%。可见,基于线性八叉树结构的交通三维缓冲区构建方法能显著降低分析节点数量,提高交通三维缓冲区的构建效率。In order to solve the problem that the existing GIS buffer algorithm can not create the 3D buffer zone of urban rail transit,octree was adopted as a fundamental data structure for creating the 3D buffer zone.The 3D solid information of urban rail transit was stored by using linear octree encoding,and the analysis of 3D buffer zone was transferred into the spatial analysis of octree nodes.The topology of octree nodes was analyzed,and a new algorithm,i.e.0-1 swap＆amp;nbsp;algorithm,was proposed for linear octree neighborhood analysis.The boundary nodes of rail transit were identified by using the 0-1 swap algorithm,and the directions of boundary nodes were determined.The 3D buffer zone of rail transit was created by using boundary nodes.A new 3D buffer zone creation method of urban rail transit was formed based on linear octree.The boundary nodes of straight tunnel,curved tunnel,straight viaduct and curved viaduct were created by using the 0-1 swap algorithm,and the result was compared with that of conventional algorithm and classical Xiao’s algorithm.The 3D buffer zones of double-arch tunnel,single-arch tunnel and viaduct were created by using the proposed method,and the number of octree nodes extracted from the different structures was counted and compared with the number of raster nodes of traditional structure.Analysis result indicates that compared with the conventional algorithm and the classical Xiao’s algorithm,the elapsed times of boundary nodes creation for straight tunnel,curved tunnel,straight viaduct and curved viaduct are minimum by using the 0-1 swap algorithm,and the values are 5,7,10,18 ms respectively.The time complexity reduces from second order to first order by using the 0-1 swap algorithm.For the 3D buffer creation method based on linear octree,the memory spaces of octree data structures are 7.26%,3.64% and 3.72% of the spaces of raster structures when the 3D buffer zones of twin-arch tunnel,singel-arch tunnel and viaduct are created.Therefore,the 3D buffer zone creation method greatly r

关 键 词：交通地理信息系统 城市轨道交通 三维缓冲区 线性八叉树 空间结构信息 0-1 互换算法 

分 类 号：U239[交通运输工程—道路与铁道工程]