Algorithm Research For Fast Cutting Triangular Mesh Of Tooth Model

Triangular mesh model is a common representation of three-dimensional objects, which is used in computer. It has widely used in medical, industrial design and the arts area. With the development of data collection, it becomes increasingly important to let three-dimensional model more similar to the real object. What’s more, the data to be processed is in a sharp increase. People have higher requirements on operating the triangular mesh models about real-time and quickness. In this paper, it carries out a detailed analysis and research of model creation, cutting curve generation, mesh segmentation and other related algorithms which are used in triangular mesh cutting. Compared with other mesh cutting algorithms, contents of this paper have a larger increase in efficiency of the algorithm and cutting result. The main work and innovation of this paper are:(1) This paper analyzes how to calculate and produce cutting curve quickly. And it provides 2 methods to achieve this goal. Compared with other methods, these two methods are more suitable for single tooth cutting, while improves the efficiency of cutting models in different perspectives.(2) Traditional intersection computing relies on geometric data calculation. Against this bottleneck, this paper presents the method which calculates cutting curve based on graphics acceleration. This method uses Open GL’s picking mechanism to compute cutting curve. Essentially, it uses the parallel processing capabilities of graphics cards, to accelerate the detection of cutting edge triangles and the generation of cutting points, which can avoid the bottleneck and improve the efficiency of mesh model cutting. In the following, GPU technology can further improve the efficiency of the algorithm.(3) The traditional intersection calculation must have large geometric data, which makes the computational efficiency perform badly. According to the characteristic feature of the dental model, this paper presents a method of calculating cutting curve which based on feature points extraction. This method reduces the geometric data in intersection calculation by the model’s feature point. It not only improves the efficiency of computing cutting curve, but also improves the efficiency of model cutting.(4) Cutting curve destroys the triangles and topology in the cutting edge. This paper uses convex polygon triangulation and AIF(Adjacency and Incidence Framework) search algorithm to re-triangulate the triangles in the cutting edge and updates the topology.