The Surface Reconstruction Based On Delaunay Triangulation And A Field

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 methodChapter 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 research directions.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 a 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:using the Topological structure we get by using the Delaunay 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 this paper and points out the existing problems and the future research directions.