Abstract: Triangle meshes are used to represent surfaces in many applications due to their simplicity. Since the number of triangles often goes beyond the capabilities of computer graphics hardware, a large variety of simplified mesh construction algorithms have been proposed in the last years. But, the reconstruction processes of simplified meshes are generally time-consuming and memory inefficient. In this paper we suggest a fast and memory efficient method that produces high-quality simplified-polygonal-models. The method is based both on Marching Cubes algorithm and on Decimation method. !3
展开▼
