|
Title:
|
FEATURE-PRESERVING MESH SIMPLIFICATION: A VERTEX COVER APPROACH |
|
Author(s):
|
Sajid Hussain, , Hakan Grahn , Jan Persson |
|
ISBN:
|
978-972-8924-63-8 |
|
Editors:
|
Yingcai Xiao and Eleonore ten Thij |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Mesh simplification, Feature-preserving, Pair contraction, Level of details, Multiresolution modeling |
|
Type:
|
Short Paper |
|
First Page:
|
270 |
|
Last Page:
|
275 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper 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. |
|
|
|
|
|
|
