Research Of The Three Typical Schemes Of Curve Subdivision

With the rapid development of information technology, digital multimedia information has penetrated into every corner of modern society, the traditional modeling methods have been very difficult to satisfy people's needs. As a discrete modeling method, curve subdivision combines polygon mesh representation method with parameters representation method organically, and curve subdivision becomes a hot spot during researching computer graphics because of its unique advantages. This thesis describes the basic theory related to curve subdivision and application of curve subdivision, and focuses on the description of three classical curve subdivision algorithms-Doo-Sabin algorithm, Catmull-Clark algorithm and Loop algorithm of subdivision rules, and introduces geometric rules and topology rules of the three algorithms, at last implements them with a program. The program read obj and 3ds format files and displays them with help of OpenGL platform, and reveals effects of the three algorithms intuitively. The thesis analyzes and compares these three algorithms from both theoretical and practical aspects, and verifies Doo-Sabin and Catmull-Clark subdivision schemes are based on the quadrilateral mesh when Loop subdivision scheme is based on the triangular mesh. Finally, find Catmull-Clark subdivision scheme is slightly better than Doo-Sabin algorithm and Loop algorithm after colligating of various aspects of analysis results.