loading...
Shape-Adaptive 3-D Mesh Simplification Based on Local Optimality Measurement
Tsinghua University, Beijing October 09-October 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCCGA.2002.116790210th Pacific Conference on Computer G ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In Kyu Park, Samsung Advanced Institute of Technology
Sang Wook Lee, Sogang University
Sang Uk Lee, Seoul National University
Mesh simplification is the process of reducing the number of triangles in a mesh representation of object surface. For a given level of detail or error tolerance, the conventional mesh simplification algorithms maximize the edge length globally, without explicitly considering local object shape. In this paper, we present a shape-adaptive mesh simplification algorithm that locally maximizes edge length, depending on local shape. The proposed algorithm achieves shape-adaptive simplification by iteratively maximizing edges between vertices, based on the comparison with the "optimal" edge lengths derived from local directional curvatures for a given error tolerance.
Citation:
In Kyu Park, Sang Wook Lee, Sang Uk Lee, "Shape-Adaptive 3-D Mesh Simplification Based on Local Optimality Measurement," pg, pp.462, 10th Pacific Conference on Computer Graphics and Applications (PG'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.