Feature-preserving Mesh Simplification: A Vertex Cover Approach

Document type: Conference Papers
Peer reviewed: Yes
Author(s): Sajid Hussain, Håkan Grahn, Jan A. Persson
Title: Feature-preserving Mesh Simplification: A Vertex Cover Approach
Conference name: International Conference on Computer Graphics and Visualization 2008 (CGV 2008)
Year: 2008
Pagination: 270-275
City: Amsterdam, The Netherlands
Organization: Blekinge Institute of Technology
Department: School of Engineering - Dept. of Systems and Software Engineering (Sektionen för teknik – avd. för programvarusystem)
School of Engineering S- 372 25 Ronneby
+46 455 38 50 00
http://www.tek.bth.se/
Language: English
Abstract: In computer graphics image synthesis algorithms like ray tracing, the mesh complexity decreases the performance of these algorithms. Therefore, the need arises to reduce the complexity of these meshes and at the same time preserving the salient features of the shape. Initial selection of vertices for mesh simplification heavily relates with the quality of the simplified meshes. In this paper, we present a greedy approach to select initial vertex contraction pairs to preserve salient features in the simplified meshes. The greedy algorithm exploits the property of meshes where vertices forming small features contain less number of edges. The technique selects vertices connected with large number of edges and makes them potential candidates for contraction according to a given cost function. The purpose is to first simplify those regions which are enriched with number of triangles and preserve small details of the shape constructed with small number of triangles. Our technique preserves very small details in the shape even after considerable simplification as compared to other existing techniques. Initial experiments show promising results with preserved salient features.
Subject: Computer Science\Computersystems
Keywords: Mesh simplification, Feature-preserving, Pair contraction, Level of details, Multiresolution modeling
Edit