Research Of 3D Model Simplification Algorithm Based On Meaningful Segmentation

At present,the techniques of animation in movie and television,3D online games and virtual reality are developing rapidly.The application of three-dimensional geometric model in these fields is becoming more and more widely,and three-dimensional geometric model of structure and treatment are becoming more and more complex.In order to solve the contradiction between the model complexity and the performance of computer hardware,which is the contradiction between the unlimited growth of model complexity and the limited storage capacity,computing speed and transfer rate of computer,the technique of model simplifying is emerged.In recent years,the technique is gradually become a research point in the field of computer graphics.The study of model simplification has made a series of achievements at China and abroad. Lounsbery etc.had raised a method of mesh simplification based on the theory of wavelet decomposition.Rossignac,etc.had raised a method of mesh simplification based on vertex clustering.Schroeder,etc.had raised a method of mesh simplification based on vertex deleting. Hoppe,etc.had raised a method of mesh simplification based on edge contracting.In recent years, there have been a number of ways for the model characteristics.Isler had raised a progressive coding method which combined geometry and texture.Using the quadric error,Ronfard had raised a method which reserved triangle-color and border edge.However,the cost of edge collapse of the current simplified algorithms is to change the location of the geometric,and hardly consider how to maintain the model of the visual effects.In addition,many algorithms haven't considered visual features at the process of simplification,which would cause the mistake of choosing the folded edge.Thus,these issues would affect the visual effects of the simplified model.In view of the above questions,we present a simplified algorithm of mesh model based on meaningful segmentation.Before the process of mesh simplification,the algorithm segments the model meaningfully.And in the process of simplification,we consider the geometric features and the Visual features of sub-mesh.In addition,we present an improved algorithm of meaningful segmentation.Because the algorithm uses the expansion neighborhood of vertex when computing the rates of discrete main areas of vertex,it has a very good segmentation results for the model of large amount of data.We carry out experiments in the Eclipse platform with Java language.The result shows that the method is effective.It can ensure the visual characteristics of model better than the others,and reduce the distortion of model.