QEM-based mesh simplification with global geometry features preserved
Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Feature detection of triangular meshes based on tensor voting theory
Computer-Aided Design
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
Mesh simplification with vertex color
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
| Hi-index | 0.00 |
In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the multi-resolution representation. In this paper, we propose anew and simple constraint scheme based on the quadric error metric proposed by Garland and Heckbert [1] to preserve face colors and boundary edges during the simplification process. In addition, our method generates progressive meshes that store the polygonal mesh in a continuous multi-resolution representation. According to our experimental results, this new method is successful in preserving face colors and boundary edges. Moreover, we compare the latency of resolution changes for the progressive meshes of various models.