Mesh Fusion

This paper focuses on mesh fusion,a new developing research branch driven by the vigorously growing entertainment industry such as movie,TV and game. The purpose of the research is to create a new model from existing geometric models with their characteristics. The existing mesh fusion methods have two disadvantages. Firstly,they cannot deal with dense meshes. Secondly,they have the topological restrictions. In this paper,we proposed some new solutions to these problems with satisfactory results.The whole framework of the paper is organized as follows:In chapter one,we introduce the computer graphics knowledge and research tendency closely related to the subject. We analyzed the advantages and disadvantages of the existing algorithms one by one,and presented the innovative contribution of the paper.In chapter two,we propose a mesh fusion algorithm base on local harmonic mapping. Compared with the global harmonic mapping method,this approach has the following advantages. (1) The efficiency of the algorithm is greatly improved. The computational cost involved no longer increases exponentially with the number of vertices of the meshes to be fused. (2) The algorithm is robust as the ambiguity in graph structure combination is alleviated. (3) The detail of the cut mesh is fully kept. (4) The topology restriction of the original algorithm is eliminated.In chapter three,we propose a mesh fusion algorithm base on variational implicit surface. By constructing a transition object between the objects to be fused,this method overcomes the topological restrictions. In chapter four,we introduce the implementation of the interactive task in chaptertwo and three. Finally,we conclude this dissertation and discuss some directions for future work.