平面交叉口竖向设计辅助设计系统的研究开发
|
摘要
平面交叉口是道路系统极其重要的组成部分,是道路交通的咽喉。平面交叉口竖向设计是平面交叉口设计中最重要的一个环节,其设计合理与否直接影响交叉口表面平顺度,行车舒适性,排水质量以及审美需求。随着我国道路交通的发展,道路交叉情况日益增多,平面交叉口形式越来越复杂,工程要求越来越高,这就要求设计人员能够既快又好地完成设计任务。
本文在了解平面交叉口竖向设计CAD技术发展和应用现状的基础上,结合土木工程CAD软件发展的历程和特点,深刻洞察国内外平面交叉口竖向设计CAD软件的发展情况,分析出了平面交叉口竖向设计CAD软件的不足。最后根据市政工程MECAD软件升级和创新的需要,围绕实际平面交叉口竖向设计问题,进行相关研究并开发出了独立完善智能的平面交叉口竖向设计CAD系统。
本文通过对各种类型平面交叉口的分析和比较,总结出了它们的共同特性:即都是多边形网络图结构;接着利用图论、拓扑约束理论建立平面交叉口的多边形网络拓扑结构、数据存储模型和条件约束模型,进而将三者整合为图模型;然后通过最小多边形的自动搜索实现交叉口区域的自动划分,以区域为单位获取计算点;最后集合所有的计算点生成平面交叉口Delaunay三角网立体模型进而自动生成等高线图。
系统的主要创新点在于利用图论、拓扑约束理论建立平面交叉口的多边形网络拓扑结构、数据存储模型和条件约束模型,进而将三者整合为图模型,从而实现平面交叉口的自动分区和计算点的获取。
Grade crossing is an important constituent part in road system, it is the“throat”of road traffic. The elevation planning of grade crossing is a significant design . Whether the design is reasonable affects the smoothness of the surface, driving comfort, drainage performance, needs of aesthetic. With the development of road traffic, the situation of road crossing is increasing, grade crossing’s form is more complex, engineering requirements is higher. Therefore, designers must be able to complete the design task fast and well.
This paper on the basis of learning the status of development and applications of CAD technology for the elevation planning of grade crossing, combine the process and characteristics of development of Civil CAD, profound insight the situation of development of CAD software for the elevation planning of grade crossing at home and abroad, analysis the less CAD software for the elevation planning of grade crossing. Finally, according to the need of upgrade and innovation of municipal engineering MECAD software, around the actual intersection of the elevation planning, conduct relevant research and development independent, perfect, intelligent CAD system for the elevation planning of grade crossing.
Through summarize various types of intersection, we can get their common characteristic: they are all polygon net graph structures; Then this paper use graph theory, topology constrained to develop software. The topology model, data storage model and constraints model will be use to format graph model. Then the smallest polygon areas can be searched automatically, district the intersection to obtain the calculating points, collect all the calculating points to generat Delaunay triangulation model. Finally, contour map can be generated automatically.
The main innovation of the system is to use graph theory, topology constrained to establish the topology model, data storage model and constraints model , integrate the three to format graph model. Then the smallest polygon areas and calculating points can be generated automatically.
本文在了解平面交叉口竖向设计CAD技术发展和应用现状的基础上,结合土木工程CAD软件发展的历程和特点,深刻洞察国内外平面交叉口竖向设计CAD软件的发展情况,分析出了平面交叉口竖向设计CAD软件的不足。最后根据市政工程MECAD软件升级和创新的需要,围绕实际平面交叉口竖向设计问题,进行相关研究并开发出了独立完善智能的平面交叉口竖向设计CAD系统。
本文通过对各种类型平面交叉口的分析和比较,总结出了它们的共同特性:即都是多边形网络图结构;接着利用图论、拓扑约束理论建立平面交叉口的多边形网络拓扑结构、数据存储模型和条件约束模型,进而将三者整合为图模型;然后通过最小多边形的自动搜索实现交叉口区域的自动划分,以区域为单位获取计算点;最后集合所有的计算点生成平面交叉口Delaunay三角网立体模型进而自动生成等高线图。
系统的主要创新点在于利用图论、拓扑约束理论建立平面交叉口的多边形网络拓扑结构、数据存储模型和条件约束模型,进而将三者整合为图模型,从而实现平面交叉口的自动分区和计算点的获取。
Grade crossing is an important constituent part in road system, it is the“throat”of road traffic. The elevation planning of grade crossing is a significant design . Whether the design is reasonable affects the smoothness of the surface, driving comfort, drainage performance, needs of aesthetic. With the development of road traffic, the situation of road crossing is increasing, grade crossing’s form is more complex, engineering requirements is higher. Therefore, designers must be able to complete the design task fast and well.
This paper on the basis of learning the status of development and applications of CAD technology for the elevation planning of grade crossing, combine the process and characteristics of development of Civil CAD, profound insight the situation of development of CAD software for the elevation planning of grade crossing at home and abroad, analysis the less CAD software for the elevation planning of grade crossing. Finally, according to the need of upgrade and innovation of municipal engineering MECAD software, around the actual intersection of the elevation planning, conduct relevant research and development independent, perfect, intelligent CAD system for the elevation planning of grade crossing.
Through summarize various types of intersection, we can get their common characteristic: they are all polygon net graph structures; Then this paper use graph theory, topology constrained to develop software. The topology model, data storage model and constraints model will be use to format graph model. Then the smallest polygon areas can be searched automatically, district the intersection to obtain the calculating points, collect all the calculating points to generat Delaunay triangulation model. Finally, contour map can be generated automatically.
The main innovation of the system is to use graph theory, topology constrained to establish the topology model, data storage model and constraints model , integrate the three to format graph model. Then the smallest polygon areas and calculating points can be generated automatically.
引文
[1]成基华,范玉青,袁国平等.新一代公路CAD系统及其发展趋势.国外公路, 1999, 1(3).
[2] Roller D. An approach to computer-aided parametric design Computer-Aided Design. 1991
[3]丁建明,杨顺新,王富民.动态、交互道路CAD平面设计系统研究.东南大学学报. 1998, 28(3).
[4]吴小平,杨俊.MECAD 5.0市政工程设计系统.中国水运, 2005, 12
[5] Zhizhou Wu, Xiaoguang Yang, Jiafa Gao. Research and development of the traffic design computer aided system for urban road grade intersections in china. Computing in Civil Engineering, 2005, 179(97): 7-9.
[6]丁建明,程建川,李方.德国道路设计软件CARD/1系统.国外公路, 1997, 17(5): 15-17.
[7]朱照宏,符锌砂,李方,方守恩.道路勘测设计软件开发于应用指南.人民交通出版社, 2003.
[8]吴瑞麟,沈建武.道路规划与勘测设计.华南理工大学出版社, 2002
[9]徐青,常歌,杨力.基于自适应分块的TIN的三角网建立算法[J].中国图象图形学报, 2000, 5(6).
[10]林报嘉,叶燕林.三角网的生成与简化算法[J].地理学与国土研究, 2001, 17(1).
[11] Macedonio G and Pareschi M T. An algorithm for the triangulation of arbitrarily distributed points: applications to volume estimate and terrain fitting[J]. Computers& Geosciences, 1991, 17:859—874
[12]裴玉龙,邓建华.双线性Coons曲面在平面交叉口竖向设计中的应用[J].哈尔滨建筑大学学报, 2005, 1(35): 113-116.
[13]吴国雄,严强,孙家驷.双三次曲面在交叉口立面设计中的应用研究[J].重庆交通学院学报, 2001, 2(20): 6-8.
[14] Gerald Farin, Dianne Handsford. Discrete coons patches[J]. Computer Aided Geometric Dianne, 1999, 16(7): 691-700.
[15] Farin, Gerald.1990.Curves and Surface in Computers Aided Geometric Design: A practical Guide. Academic Press, Boston.
[16] [美]Philip J.Schneider David H.Eberly著,周长发译.计算机图形学几何工具算法详解.电子工业出版社. 2005.
[17]范逢曦.图论方法及应用.太原:山西科学教育出版社, 1987, 32(20): 23-25.
[18]韦人玮,吴小芳,杜清运.基于图模型和拓扑约束的管网数据一致性检测.地理空间信息, 2006, 4(1): 90-92.
[19] Raghavan Kunigahalli, Jeffrey S.Russell. Dharmaraj Veeramani Extracting Topological Relationships from Wire-Frame CAD Model Journal of Computing in Civil Engineering, Vol.9, No.1, January 1995, pp.29-42.
[20]张国伟,马庆贤,焦伟.基于图结构描述的几何约束模型的研究与建立. China Academic Journal Electronic Publishing House, 2006, 17(110): 27-29.
[21] Suzuki H, Ando H, Kimura F.Geometric constraints and reasoning for geometric CAD systems Computer &Graphics, 1990.
[22] Autodesk.Civil3D2008 vs MX_FINAL. Autodesk White paper, 2007,12(121): 1-8.
[23]孙江宏,丁立伟,米洁. AutoCAD ObjectARX开发工具及应用.清华大学出版社. 1992.2.
[24] Bela Bollobas. Modern Graph Theory.北京:世界图书出版公司, 2003.
[25]陈志远,李西琴.基于边界搜索的AutoCAD图形区域划分算法[J].现代制造工程, 2005, 9(4):50-53.
[26] Kincho H. Law and Steven J. Fenves Sparse Matrices, Graph Theory, and Reanalysis Computing in Civil Engineering (1981) pp.234-249.
[27] Karl Beucke, Daniel G. Beer.Net-distributed Applications in Civil Engineering: Approach and transition concept for CAD systems. Computing in Civil Engineering, 2005, 14(11): 10-11.
[28]李杰,张文栋,张樨.一种多边形道路网络拓扑生成算法的设计与实现.电子学报, 2006 ,8.
[29]周立新,严静,潘云鹤.一个基于图的多边形拓扑关系生成算法.计算机应用, 1999, 19(10).
[30]梁晓文,刘宗岐,陈宜金.基于夹角变化趋势的多边形自动搜索和生成算法.中国图象图形学报, 2005,10(6).
[31]李大军,刘波,赵宝贵,肖根如.拓扑多边形自动构建的一种改进算法.
[32]邹秋生.自动搜索最小多边形算法的研究.测绘工程, 1996, 5(2).
[33]田丰林.基于DEM的道路设计CAD系统.浙江大学, 2004, 19.
[34]刘学军,赵吉先,符锌砂.三角网数字地面模型的动态修改与编辑[J].中国公路学报, 2000, 13(4): 16-20.
[35]张祖勋,张剑清. Delaunay三角网表示和点删除方法[J].计算机工程与设计, 2010.
[36]许天会.不规则三角网的建立与应用[硕士学位论文].武汉:华中科技大学, 2007.
[37] Lee D T and Schacher B J. Two algorithms for constructing a delaunay triangulation[J]. International Journal of Computer and Information Sciences, 1980, 10(9): 219-242.
[38]胡卫明,吴兵.地图等高线实时内插算法.计算机学报, 2000, 23(8): 847-851.
[39]李殷,朱益虎. DTM在土方计算中的应用地矿测绘2006, 22(4): 33-36.
[40] Matthew H, Austern. Generic Programming and the STL: Using and extending the C++ Standard Temlate Library, 2003.
[41] David R.Musser and Atul Saini. STL Tutorial and reference Guide: C++ Programming with the Standard Template Library. Addison-Wesley, Reading, MA, 1996.
[42] Robert Sedgewick. C++算法-图算法.第一版.林琪译.北京:清华大学出版社. 2003.
[2] Roller D. An approach to computer-aided parametric design Computer-Aided Design. 1991
[3]丁建明,杨顺新,王富民.动态、交互道路CAD平面设计系统研究.东南大学学报. 1998, 28(3).
[4]吴小平,杨俊.MECAD 5.0市政工程设计系统.中国水运, 2005, 12
[5] Zhizhou Wu, Xiaoguang Yang, Jiafa Gao. Research and development of the traffic design computer aided system for urban road grade intersections in china. Computing in Civil Engineering, 2005, 179(97): 7-9.
[6]丁建明,程建川,李方.德国道路设计软件CARD/1系统.国外公路, 1997, 17(5): 15-17.
[7]朱照宏,符锌砂,李方,方守恩.道路勘测设计软件开发于应用指南.人民交通出版社, 2003.
[8]吴瑞麟,沈建武.道路规划与勘测设计.华南理工大学出版社, 2002
[9]徐青,常歌,杨力.基于自适应分块的TIN的三角网建立算法[J].中国图象图形学报, 2000, 5(6).
[10]林报嘉,叶燕林.三角网的生成与简化算法[J].地理学与国土研究, 2001, 17(1).
[11] Macedonio G and Pareschi M T. An algorithm for the triangulation of arbitrarily distributed points: applications to volume estimate and terrain fitting[J]. Computers& Geosciences, 1991, 17:859—874
[12]裴玉龙,邓建华.双线性Coons曲面在平面交叉口竖向设计中的应用[J].哈尔滨建筑大学学报, 2005, 1(35): 113-116.
[13]吴国雄,严强,孙家驷.双三次曲面在交叉口立面设计中的应用研究[J].重庆交通学院学报, 2001, 2(20): 6-8.
[14] Gerald Farin, Dianne Handsford. Discrete coons patches[J]. Computer Aided Geometric Dianne, 1999, 16(7): 691-700.
[15] Farin, Gerald.1990.Curves and Surface in Computers Aided Geometric Design: A practical Guide. Academic Press, Boston.
[16] [美]Philip J.Schneider David H.Eberly著,周长发译.计算机图形学几何工具算法详解.电子工业出版社. 2005.
[17]范逢曦.图论方法及应用.太原:山西科学教育出版社, 1987, 32(20): 23-25.
[18]韦人玮,吴小芳,杜清运.基于图模型和拓扑约束的管网数据一致性检测.地理空间信息, 2006, 4(1): 90-92.
[19] Raghavan Kunigahalli, Jeffrey S.Russell. Dharmaraj Veeramani Extracting Topological Relationships from Wire-Frame CAD Model Journal of Computing in Civil Engineering, Vol.9, No.1, January 1995, pp.29-42.
[20]张国伟,马庆贤,焦伟.基于图结构描述的几何约束模型的研究与建立. China Academic Journal Electronic Publishing House, 2006, 17(110): 27-29.
[21] Suzuki H, Ando H, Kimura F.Geometric constraints and reasoning for geometric CAD systems Computer &Graphics, 1990.
[22] Autodesk.Civil3D2008 vs MX_FINAL. Autodesk White paper, 2007,12(121): 1-8.
[23]孙江宏,丁立伟,米洁. AutoCAD ObjectARX开发工具及应用.清华大学出版社. 1992.2.
[24] Bela Bollobas. Modern Graph Theory.北京:世界图书出版公司, 2003.
[25]陈志远,李西琴.基于边界搜索的AutoCAD图形区域划分算法[J].现代制造工程, 2005, 9(4):50-53.
[26] Kincho H. Law and Steven J. Fenves Sparse Matrices, Graph Theory, and Reanalysis Computing in Civil Engineering (1981) pp.234-249.
[27] Karl Beucke, Daniel G. Beer.Net-distributed Applications in Civil Engineering: Approach and transition concept for CAD systems. Computing in Civil Engineering, 2005, 14(11): 10-11.
[28]李杰,张文栋,张樨.一种多边形道路网络拓扑生成算法的设计与实现.电子学报, 2006 ,8.
[29]周立新,严静,潘云鹤.一个基于图的多边形拓扑关系生成算法.计算机应用, 1999, 19(10).
[30]梁晓文,刘宗岐,陈宜金.基于夹角变化趋势的多边形自动搜索和生成算法.中国图象图形学报, 2005,10(6).
[31]李大军,刘波,赵宝贵,肖根如.拓扑多边形自动构建的一种改进算法.
[32]邹秋生.自动搜索最小多边形算法的研究.测绘工程, 1996, 5(2).
[33]田丰林.基于DEM的道路设计CAD系统.浙江大学, 2004, 19.
[34]刘学军,赵吉先,符锌砂.三角网数字地面模型的动态修改与编辑[J].中国公路学报, 2000, 13(4): 16-20.
[35]张祖勋,张剑清. Delaunay三角网表示和点删除方法[J].计算机工程与设计, 2010.
[36]许天会.不规则三角网的建立与应用[硕士学位论文].武汉:华中科技大学, 2007.
[37] Lee D T and Schacher B J. Two algorithms for constructing a delaunay triangulation[J]. International Journal of Computer and Information Sciences, 1980, 10(9): 219-242.
[38]胡卫明,吴兵.地图等高线实时内插算法.计算机学报, 2000, 23(8): 847-851.
[39]李殷,朱益虎. DTM在土方计算中的应用地矿测绘2006, 22(4): 33-36.
[40] Matthew H, Austern. Generic Programming and the STL: Using and extending the C++ Standard Temlate Library, 2003.
[41] David R.Musser and Atul Saini. STL Tutorial and reference Guide: C++ Programming with the Standard Template Library. Addison-Wesley, Reading, MA, 1996.
[42] Robert Sedgewick. C++算法-图算法.第一版.林琪译.北京:清华大学出版社. 2003.