基于Delaunay三角剖分与场表示的曲面重建-计算数学专业论文.docxVIP

摘 摘 要 本文主要研究了基于Delaunay三．角剖分及场表示的曲面重建问题，提出了一种新的初 始迭代曲面的构造方法． 第一章中我们首先介绍了有关逆向工程的内容及研究现状，并且详细论述了数据稀疏 算法及该算法的实现结果．在此基础上给出了本文的研究方向． 第二章中我们介绍TDelaunay=-：-角剖分的相关内容，具体的实现算法及算法实现结 果． 第三章中介绍了场表示的曲线曲面重建的基本思想，并详细给出了本文的主要研究内 容．即：只采用三角剖分重建出来的曲面质量无法得到保证；而只采用场表示的三维曲面重 建算法中，我们采用最小包围盒作为初始迭代曲面进行循环迭代，这样使算法的收敛速度比 较慢，并且只适合处理封闭的曲面，基于这些缺陷．本文中我们提出将两种方法相结合的改 进方法，也就是：Delaunay=_．角剖分获得的散乱点的拓扑结构作为初始迭代曲面，结果证 明这种方法不仅可以保证重建曲面的质量而且可以极大的提高收敛速度，并且也适合处理 末封闭的曲面．并给出具体的实现结果．最后对全文进行总结，并指出存在的一些问题及以 后的研究方向． 关键词：逆向工程，曲面重建，Delaunay三角剖分，场函数，散乱点云 AbstractThis Abstract This thesis centers on the surface reconstruction based on the Delaunay Triangulation and a Field and proposes a new initial iteration of the surface structure method． Chapter 1 firstly introduces the contents and research status of reverse engineering and discusses the sparse algorithm and its concrete results．On the basis we give our Chapter 2 introduces the related contents，concrete algorithm and its achieving results of Delaunay Triangulation． Chapter 3 introduces the basic thought of curve and surface reconstruction based on field and we show the main research contents．i．e：The quality of surface can not be ensured when we employ triangulation method；At the same time，In the original surface reconstruction algorithm of three dimension which based on a field，we employ the least bounding box as the initially iterative surface to go for iterating．However，this will make the convergence speed more slowly,and this method is only suited to the closed surface． Faced on these defects，In the paper we put forward a new method which combines the two method．i．e：nsing the Topological structure we get by using the Delannay Triangulation to the clouded point sets as the initially iterative surface．In the method，we can prove that not only Can it ensure the quality of surface but make the convergence speed very fast． what is more，this method is also suited to the unclosed surface．At last，we give out the results of the concrete examples． In the end，we summarized