JIANG Hong-fei, TU Peng, LI Guo-zhong. Building method of double tracks railway 3D model[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 21-24.
Citation: JIANG Hong-fei, TU Peng, LI Guo-zhong. Building method of double tracks railway 3D model[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 21-24.

Building method of double tracks railway 3D model

More Information
  • Author Bio:

    JIANG Hong-fei(1967-), male, PhD, associate professor, 86-731-2655164, jhf1967@263.net

  • Received Date: 2003-06-09
  • Publish Date: 2004-02-25
  • The 3D model of double tracks railway was developed by surface partition. With this method the faces of terrain, bed, bridge, tunnel and other entities were cut into regular surfaces, and the grid meshes were utilized to represent them. The algorithm inserted the vertices of bed boundaries into terrain triangular mesh to form a new mesh, deleted the triangles, which located into the bed boundaries, and thereby merged the terrain and the construction models to obtain the 3D overall model of double tracks raiway.The 3D modeling of route was realized based on the model with the integration of 3DS MAX and AutoCAD. The applied results indicate that the method has fast speed and high reliability and is a feasible measurement for building 3D model of double tracks railway.

     

  • loading
  • [1]
    WU Xiao-bo, WANG Shi-xing, XIAO Chun-sheng. A new study of delaunay triangulation creation[J]. Acta Geodaetica et Cartographica Sinica, 1999, 28(1): 28-35. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-CHXB202009003.htm
    [2]
    Franco P P, Michael L S. Computational Geometry[M]. New York: Springer-Verlag, 1985.
    [3]
    Bowyer A. Computing dirichlet tessellations[J]. Computer Journal, 1981, 24(2): 162-166. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJX201508001.htm
    [4]
    MA Xiao-hu, PAN Zhi-geng, SHI Jiao-ying. Delaunay triangulation of simple polygon based on determination of convex-concave vertices[J], Journal of Computer Aided Design and Computer Graphics, 1999, 11(1): 1-3. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JSJX202101003.htm
    [5]
    Watson D F. Computing the n-dimension delaunay tesselation with application to voronoi polytopes[J]. Computer Journal, 1981, 24(2): 167-172. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJX202103006.htm
    [6]
    ZHOU Xiao-yun, LIU Shen-quan. A robust algorithm for constrained delaunay triangulation[J]. Chinese Journal of Computers, 1996, 19(8): 615-624. (in Chinese) doi: 10.3321/j.issn:0254-4164.1996.08.008
    [7]
    Sloan S W. A fast algorithm for constructing delaunay triangulation in the plane[J]. Advanced Engineering Software, 1987, 9 (1): 34-55. https://www.cnki.com.cn/Article/CJFDTOTAL-GDYJ202009010.htm
    [8]
    JIANG Hong-fei. Study on the algorithm for instantly generating delaunay triangulation of plannar scattered point set[J]. China Railway Science, 2003, 24(2): 44-47. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGFX202201005.htm
    [9]
    ZHAN Zhen-yan, JIANG Hong-fei, PU Hao. Alignment design and overall optimization design for double track railway[J]. Journal of the China Railway Society, 1998, 20(6): 81-85. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-MTXB202006002.htm
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (303) PDF downloads(227) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return