SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A data reduction scheme for triangulated surfaces
Computer Aided Geometric Design
Interactive multiresolution surface viewing
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Simplifying surfaces with color and texture using quadric error metrics
Proceedings of the conference on Visualization '98
New quadric metric for simplifiying meshes with appearance attributes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
MSE '02 Proceedings of the Fourth IEEE International Symposium on Multimedia Software Engineering
Discrete Differential Error Metric for Surface Simplification
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
Hi-index | 0.00 |
In a resource-constrained computing environment, it is essential to simplify complex meshes of a huge 3D model for visualization, storing and transmission. Over the past few decades, quadric error metric (QEM) has been the most popular error evaluation method for mesh simplification because of its fast computation time and good quality of approximation. However, quadric based simplification often suffers from its large memory consumption. Since recent 3D scanning systems can acquire both geometry and color data simultaneously, the size of model and memory overhead of quadric increases rapidly due to the additional color attribute. This paper proposes a new error estimation method based on QEM and half-edge collapse for simplifying a triangular mesh model which includes vertex color. Our method calculates geometric error by the original QEM, but reduces the required memory for maintaining color attributes by a new memory-efficient color error evaluation method.