互动优化的增量三角剖分算法  

THE INCREMENTAL TRIANGULATION ALGORITHM WITH INTERACTIVE OPTIMIZATION

作　　者：陈新河[1] 鲁业频[1] 袁宗文[1] 

机构地区：[1]巢湖学院物理与电子科学系,安徽巢湖238000

出　　处：《巢湖学院学报》2011年第6期48-52,共5页Journal of Chaohu University

基　　金：巢湖学院重点项目(XLZ201004);安徽高校省级科究项目(KJ2011B103)

摘　　要：当前三角化文献中一般只介绍点云的三角化方法,几乎没有文献注意到点云三角化过程中与用户互动的过程,按用户的要求进行点云的三角化。本算法是一种增量算法,为了提高算法是实用性,算法将剖分信息按照点的不同位置存储到不同的对应边链表和三角形链表中,以降低边和三角形的搜索操作时间,提高三角化的速度;算法中采用了加点剖分中同步优化和初步剖分后用户随意多次优化的多重优化方案提高剖分三角形的质量,并且剖分中同步优化和用户再次优化分别采用最小角最大化优化准则和曲率最小优化准则,使剖分拟合表面更加光顺。通过点云剖分的实例结果显示,该算法具有速度极快、占用内存少、形成三角表面质量高,程序运行界面友好等优点。Most current triangulation articles are talking about triangulation methods, but almost no article notes the interaction with the user in the triangulation process, which can triangulate point cloud according to the user＇s requirements. This paper＇s algorithm is an incremental algorithm, the algorithm stores the information into different side lists and different triangle lists ac- cording to the point location for improving it＇s usability,and reducing operation time for searching the sides and the triangles; this can improving the speed of triangulation; The Maximize the minimum angle optimization criteria and the Minimum curva- ture optimization criterion were both been used in this article, the former was been used in triangulating process, the latter was been used after Preliminary triangulation operation which can be used many times until the user satisfied, the double and mul- tiple optimization can ＇make the surface more smooth. The experiment result shows that the algorithm is extremely fast, the formed triangle is high-quality, and the operation is user-friendly.

关 键 词：三维重建 散乱点云 三角剖分 三角优化 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]