SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
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
Mesh reduction with error control
Proceedings of the 7th conference on Visualization '96
View-dependent refinement of progressive meshes
Proceedings of the 24th 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
Progressive forest split compression
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Smooth view-dependent level-of-detail control and its application to terrain rendering
Proceedings of the conference on Visualization '98
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
VIS '93 Proceedings of the 4th conference on Visualization '93
Mason: morphological simplification
Graphical Models
Technical Section: Moment-based metrics for mesh simplification
Computers and Graphics
Fast Decimation of Polygonal Models
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Lossless 3D steganography based on MST and connectivity modification
Image Communication
A Robust Embedding Scheme and an Efficient Evaluation Protocol for 3D Meshes Watermarking
International Journal of Computer Vision and Image Processing
| Hi-index | 0.00 |
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and the original mesh using a gradient-based optimization algorithm and a finite-element interpolation model implicitly defined on meshes. The notable contribution of this paper is the theoretical framework which permits the construction of a volume minimization process between two triangular meshes. We chose this volume-based metric because of its good perceptual properties, as it naturally and accurately fits the geometric singularities on 3D meshes. Furthermore, this metric corresponds well to a sort of intuitive error between two 3D surfaces and the resulting optimization algorithm only requires a few parameters. We show that this approach permits geometric compression leading to multi-resolution meshes with minimal visual losses.