Volume 15 Issue 2
. 
Turn off MathJax
Article Contents
Article Navigation >  Journal of Traffic and Transportation Engineering  > 2015  >  15(2): 100-108
Next Previous
ZHANG Wen-sheng, JIE Qian, ZHU Ji-jun, ZHANG Bing-zhe, JI Qiang, LI Jian-chun. 3Dbuffer zone creation method of urban rail transit[J]. Journal of Traffic and Transportation Engineering, 2015, 15(2): 100-108. doi: 10.19818/j.cnki.1671-1637.2015.02.011
Citation: ZHANG Wen-sheng, JIE Qian, ZHU Ji-jun, ZHANG Bing-zhe, JI Qiang, LI Jian-chun. 3Dbuffer zone creation method of urban rail transit[J]. Journal of Traffic and Transportation Engineering, 2015, 15(2): 100-108. doi: 10.19818/j.cnki.1671-1637.2015.02.011
shu

3Dbuffer zone creation method of urban rail transit

doi: 10.19818/j.cnki.1671-1637.2015.02.011
  • 1.

    School of Transportation, Shijiazhuang Tiedao University, Shijiazhuang 050043, Hebei, China

  • 2.

    Key Laboratory of Traffic Safety and Control of Hebei Province, Shijiazhuang Tiedao University, Shijiazhuang 050043, Hebei, China

  • 3.

    Hebei Provincial Communications Planning and Design Institute, Shijiazhuang 050011, Hebei, China

  • 4.

    School of Civil and Environmental Engineering, University of Technology of Sydney, Sydney 2007, New South Wales, Australia

More Information
  • Author Bio:

    ZHANG Wen-sheng(1971-), male, professor, PhD, +86-311-87936787, zws@stdu.edu.cn

  • Received Date: 2014-11-03
  • Publish Date: 2015-02-25
    Abstract
  • In order to solve the problem that the existing GIS buffer algorithm can not create the3 Dbuffer zone of urban rail transit, octree was adopted as a fundamental data structure for creating the 3Dbuffer zone.The 3Dsolid information of urban rail transit was stored by using linear octree encoding, and the analysis of 3Dbuffer 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 swapalgorithm, 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 3Dbuffer zone of rail transit was created by using boundary nodes.A new3 Dbuffer 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-1swap algorithm, and the result was compared with that of conventional algorithm and classical Xiao' s algorithm.The 3Dbuffer 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-1swap 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-1swap algorithm.For the 3Dbuffer 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 3Dbuffer zones of twin-arch tunnel, singelarch tunnel and viaduct are created.Therefore, the 3D buffer zone creation method greatly reduces the number of analysis nodes, and improves the efficiency of creating the 3Dbuffer zone.

     

    • FullText(HTML)
  • loading
    • References(25)
  • [1]
    ZUO Xiao-qing. 3D GIS data model and visualization in transportation network[D]. Wuhan: Wuhan University, 2004. (in Chinese).
    [2]
    TU Sheng-wen, SU Zhou. Intelligent route selection of highway alignments based on GIS and hybrid genetic algorithm and particle swarm optimization[J]. Journal of Chang' an University: Natural Science Editon, 2010, 30(4): 39-45. (in Chinese). doi: 10.3969/j.issn.1671-8879.2010.04.008
    [3]
    RIENZO F D, ORESTE P, PELIZZA S. 3DGIS supporting underground urbanisation in the city of Turin(Italy)[J]. Geotechnical and Geological Engineering, 2009, 27(4): 539-547. doi: 10.1007/s10706-009-9255-2
    [4]
    SCIANNA A. Building 3DGIS data models using open source software[J]. Applied Geomatics, 2013, 5(2): 119-132. doi: 10.1007/s12518-013-0099-3
    [5]
    WU He-hai. Problem of buffer zone construction in GIS[J]. Journal of Wuhan Technical University of Surveying and Mapping, 1997, 22(4): 358-366. (in Chinese). doi: 10.3321/j.issn:1671-8860.1997.04.013
    [6]
    PENG Ren-can, CHEN Yi, LIU Guo-hui, et al. Problem and improving method for MapInfo line(area)buffer construction model[J]. Geomatics and Information Science of Wuhan University, 2007, 32(8): 719-722. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-WHCH200708017.htm
    [7]
    BHATIA S, VIRA V, CHOKSI D, et al. An algorithm for generating geometric buffers for vector feature layers[J]. Geo-spatial Information Science, 2013, 16(2): 130-138. doi: 10.1080/10095020.2012.747643
    [8]
    GOMBOŠI M, ŽALIK B. Point-in-polygon tests for geometric buffers[J]. Computers and Geosciences, 2005, 31(10): 1201-1212. doi: 10.1016/j.cageo.2005.03.009
    [9]
    LI Ke, DU Lin. An algorithm of buffer zones based on algorithm of dialation[J]. Journal of Institute of Surveying and Mapping, 2005, 22(3): 229-231. (in Chinese). doi: 10.3969/j.issn.1673-6338.2005.03.023
    [10]
    WANG Jie-chen, SHEN Ding-tao, CHEN Yan-ming. Algorithm of raster-based distance computing on buffer generation and its implementation[J]. Bulletin of Science and Technology, 2009, 25(5): 556-561. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-KJTB200905005.htm
    [11]
    LU Xin-ming, WANG Hong-juan. An algorithm for 3Dvector buffer based on efficient Boolean operation[J]. Journal of China University of Mining and Technology, 2012, 41(3): 481-487. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-ZGKD201203024.htm
    [12]
    FAN Jun-fu, MA Ting, ZHOU Cheng-hu, et al. Research on a buffer algorithm based on region-merging of buffered geometry components and its parallel optimization[J]. Acta Geodaetica et Cartographica Sinica, 2014, 43(9): 969-975. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-CHXB201409015.htm
    [13]
    LI Fang-yu, PAN Mao, ZHU Lei. Research on the algorithm for3Draster buffer-generation[J]. Journal of Computer-Aided Design and Computer Graphics, 2005, 17(9): 1928-1932. (in Chinese). doi: 10.3321/j.issn:1003-9775.2005.09.006
    [14]
    LI Fang-yu. Research on raster-based buffer analysis in 3D GIS[J]. Computer Engineering, 2007, 33(21): 6-8. (in Chinese). doi: 10.3969/j.issn.1000-3428.2007.21.003
    [15]
    QIU Hua. Three-dimensional volume data generation and three-dimensional buffer analysis[D]. Changsha: Central South University, 2011. (in Chinese).
    [16]
    WANG Jie-chen, SHEN Ding-tao, CUI Can. RLE-B algorithm for buffer generation[J]. Geomatics and Information Science of Wuhan University, 2010, 35(9): 1121-1124. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-WHCH201009032.htm
    [17]
    JUAN-ARINYO R, SOLÉJ. Constructing face octrees from voxel-based volume representations[J]. Computer-Aided Design, 1995, 27(10): 783-791. doi: 10.1016/0010-4485(94)00032-9
    [18]
    SHI Wen-zhong. Development of a hybrid model for threedimensional GIS[J]. Geo-spatial Information Science, 2000, 3(2): 6-12. doi: 10.1007/BF02826617
    [19]
    YODER R, BLONIARZ P. A practical algorithm for computing neighbors in quadtrees, octrees, and hyperoctrees[C]∥IEEE. Proceedings of the 2006International Conference on Modeling, Simulation, and Visualization Methods. New York: IEEE, 2006: 249-255.
    [20]
    HUANG Miao, ZHANG Hai-chao, LI Chao. Algorithm for finding k-nearest neighbors based on octree segmentation in space[J]. Computer Applications, 2008, 28(8): 2046-2048, 2051. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-JSJY200808043.htm
    [21]
    HORNUNG A, WURM K M, BENNEWITZ M, et al. OctoMap: an efficient probabilistic 3D mapping framework based on octrees[J]. Autonomous Robots, 2013, 34(3): 189-206. doi: 10.1007/s10514-012-9321-0
    [22]
    MURMAN S M. Compact upwind schemes on adaptive octrees[J]. Journal of Computational Physics, 2010, 229(4): 1167-1180.
    [23]
    SAMET H. Neighbor finding in images represented by octrees[J]. Computer Vision, Graphics, and Image Processing, 1989, 46(3): 367-386.
    [24]
    SCHRACK G. Finding neighbors of equal size in linear quadtrees and octrees in constant time[J]. CVGIP: Image Understanding, 1992, 55(3): 221-230.
    [25]
    XIAO Le-bin, GONG Jian-hua, XIE Chuan-jie. A new algorithm for searching neighbors in the linear quadtree and octree[J]. Acta Geodaetica et Cartographica Sinica, 1998, 27(3): 195-203. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-CHXB803.001.htm
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    Get Citation
    PDF
    XML

    Article Metrics

    Article views (903) PDF downloads(944) Cited by()
    Proportional views
    Related

    Copyright《Journal of Traffic and Transportation Engineering》编辑部陕ICP备05001904号-1

    Address ：Editorial Department of Journal of Traffic and Transportation Engineering, Chang 'an University, Middle Section of South Second Ring Road, Xi 'an, Shaanxi（710064） Tel：029-82334388 Email：jygc@chd.edu.cn

    All visit:Today's visit:

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return