基于C#和AutoCAD的Delaunay三角剖分算法的实现  

The Arithmetic Realization of Delaunay Triangulation Based on C# and Auto CAD

作　　者：刘建耀 刘保顺[1] 

机构地区：[1]北京科技大学土木与环境工程学院,北京100083 [2]中色卢安夏铜业有限公司,赞比亚卢安夏90456

出　　处：《有色矿冶》2014年第5期9-14,共6页Non-Ferrous Mining and Metallurgy

摘　　要：本文是在.net平台下AutoCAD二次开发方面的文章,是对Delaunay三角剖分算法的总结。在算法的编程实现过程中,作者提出了许多新颖的设想,并最终获得了正确的计算结果和理想的时间效率。针对算法实现的整体框架和步骤,几个算法关键点以及算法的时间复杂度方面,文中提供了比较详细的论述。This paper is an article about Auto CAD secondary developing under .net platform and the sum-marize of Delaunay triangulation . In the process of programming , the author has advanced several of new novelty ideals , finally achieved corrected calculation result and ideal time efficiency .The whole frame and steps of arithmetic realization , several of main arithmetic and their time complicacy have been discussed in this article in detail .

关 键 词：三角剖分 边三角形分割关联调整归并 时间复杂度 

分 类 号：TD171[矿业工程—矿山地质测量]