| Mesh simplification provides an economical means of producing a simpler model which retains the important visual characteristics of the original object. In this thesis, several new algorithms are presented. Although these algorithms are directly used in the mesh simplification system, they are quite generic methods that can be used in computer graphics and are therefore independent from this system. The algorithms include separating plane algorithms, convex inclusion algorithms and a spherical triangulation algorithm. They are all applied in 3D space.;The mesh simplification system is implemented. Some data structures and programming techniques which have significantly improved the performance of the system are described. Experimental results and the comparisons with other existing systems are also provided. |
