-
摘要: 应用表面剖分原理, 研究了复线铁路三维模型的构建方法, 将地形、桥梁、隧道等实体表面分割为一系列规则的曲面, 并用格网对其进行描述。将路基的边界点投入到地形三角网中构建新的三角网, 并删除位于边界内的三角形, 从而将地形与建筑物三维模型拼合在一起形成路线三维整体模型, 通过集成AutoCAD及3DSMAX达到对路线三维造型的目的。应用结果表明该方法具有建模速度快, 可靠性高的特点, 对构建复线铁路线路三维模型是可行的。Abstract: 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.
-
Key words:
- railway engineering /
- double tracks railway /
- 3D model /
- DTM /
- animation
-
[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 -
下载:
点击查看大图
图(4)
计量
- 文章访问数: 303
- HTML全文浏览量: 126
- PDF下载量: 227
- 被引次数: 0
