Grid Model Of Triangle Mesh Segmentation The Bezier Curve Approximation Technology Research

As the current advanced modeling tools continue to emerge and3D data scanning technology has become more sophisticated, the data accuracy and details of geometric models are put forward higher requirements, this also leads to a sharp growth of3D model data size and complexity, and thus proposes a huge challenge to the existing3D graphics engine processing capacity and speed, consequently it has brought great difficulties to the edit drawing, interactive display, virtual roaming, network, information sharing and other applications of3D models; on the other hand, more and more network service requires the transmission of3D models through the Internet, however, the network bandwidth has seriously hindered the media propagation.How to reconstruct the complex model with less amount of data, in the case of keeping the geometrical feature, consequently to reduce network bandwidth and accelerate the rendering speed, has become a research focus in the field of international graphics in recent years. This study is just from the perspective of compressing the amount of complex models, which also has important practical significance in reverse engineering, computer vision, virtual reality, medical, electronic commerce and other various application fields.The main work of this paper includes the following four aspects:1. An edge collapse simplification algorithm based on quadric error metric is analyzed and realized in detail. This algorithm has excellent performance both in execution efficiency and simplification effect, and can implement mesh simplification of any size, according to the specified amount of mesh or simplification ratio.2. A triangle domain division algorithm induced by simplified model is proposed. Take the domain generated by simplified model as the topology of triangle domain, then adopt the shortest distance algorithm to project the shadow control vertices of simplified model onto the original mesh, and then use the short line boundary form as the boundary of triangle domain. The algorithm is completed mainly by simplification and projection, and there is an approximate linear relation between the size of mesh and the speed generating the boundary, what’s more, the bigger the longer.3. A triangular Bezier curve fitting algorithm is put forward. With the good nature of Bezier curve, construct a three Bezier curve between two control vertices to describe their shortest path approximately, forming a boundary of the segmentation model. The algorithm generates a more smooth boundary, which can make up for the defect that the line edges and comers are clear when the simplification ratio is high, furthermore, the efficiency is very high.4. In order to gain the maximum degree of approximation to the initial model in the case of keeping the model similarity, and aslo generate the multiresolution representation, a Bezier curve subdivision algorithm with the fusion of LOOP subdivision idea is presented. Combining the mesh simplification algorithm with this subdivision algorithm, we can not only achieve the multiresolution representation of the mesh model, but also reduce the model subdivision approximation processing time effectively, which is in favor of the real-time rendering and transmission of3D models.