基金项目：铁道部科技研究开发计划项目(铁建电 2001-11)
作者简介：蒋红斐(1967-),男,广西桂林人,中南大学副教授,博士,从事路线的计算机辅助设计研究.
作者单位：蒋红斐（中南大学,土木建筑学院,湖南,长沙,410075）
涂鹏（中南大学,土木建筑学院,湖南,长沙,410075）
李国忠（中南大学,土木建筑学院,湖南,长沙,410075）
参考文献：
［1］武晓波,王世新,肖春生.Delaunay三角网的生成算法研究[J].测绘学报,1999,28(1):28-35.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)
［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.
［4］马小虎,潘志庚,石教英,基于凹凸顶点判定的简单多边形Delaunay三角剖分[J].计算机辅助设计与图形学学报,1999,11(1):1-3.MA Xiao-hu,PAN Zhi-geng, SHI Jiao ying. Delaunay triangu lation 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)
［5］Watson D F. Computing the n-dimension delaunay tesselation with application to voronoi polytopes[J]. Computer Journal,1981,24(2) : 167-172.
［6］周晓云,刘慎权.实现约束Delaunay三角剖分的健壮算法[J].计算机学报,1996,19(8):615-624.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)
［7］Sloan S W. A fast algorithm for constructing delaunay triangu lation in the plane[J]. Advanced Engineering Software, 1987,9(1) :34-55.
［8］蒋红斐.离散点集实时Delaunay三角网剖分算法的研究[J].中国铁道科学,2003,24(2):44-47.JIANG Hong-fei. Study on the algorithm for instantly genera ting delaunay triangulation of plannar scattered point set[J].China Railway Science, 2003,24 (2): 44-47. ( in Chinese)
［9］詹振炎,蒋红斐,蒲浩,复线铁路的线型设计与整体优化[J].铁道学报,1998,20(6):81-85.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)
|
收稿日期：2003年6月9日
出版日期：2004年3月1日
|
|
