A comparison of surface subdivision algorithms for polygonal meshes Available to Purchase

We present a new program package for interactive implementation and 3D visualization of three fundamental algorithms for surface subdivision. Namely, these are Doo-Sabin algorithm, Catmull-Clark algorithm, and Peters-Reif algorithm. Our work and contributions are in the field of experimental algorithmics and algorithm engineering. We have chosen Open GL and Qt graphics libraries as our main implementation and visualization tools. Our program analyzes the validity of the loaded mesh and proceeds with valid meshes only. We provide a user friendly interface so that users can load their own data sets. The latter allows wide testing and comparing the results from the implementation of the three algorithms on arbitrary polygonal meshes. The program has also an option for creating new polygonal meshes. We experimented extensively with our package. We compared the behaviour of the three algorithms based on different criteria and using meshes of increasing complexity. The experimental results are presented and analyzed.