SIGGRAPH '92 Proceedings of the 19th 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
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Smooth hierarchical surface triangulations
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive multi-resolution modeling on arbitrary meshes
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Optimal triangulation and quadric-based surface simplification
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
A Survey of Polygonal Simplification Algorithms
A Survey of Polygonal Simplification Algorithms
LOD Modelling of Polygonal Models Based on Multiple Choice Optimization
MMM '04 Proceedings of the 10th International Multimedia Modelling Conference
Fast Decimation of Polygonal Models
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Fast and reliable decimation of polygonal models based on volume and normal field
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Hi-index | 0.00 |
An automatic edge-collapse based simplification method has been proposed for decimation of polygonal models and generating their LODs (Levels of detail). The measure of geometric fidelity employed is motivated by the normal space deviation of a polygonal model arising during its decimation process and forces the algorithm to minimize the normal space deviation. In spite of the global nature of the evaluation of geometric deviation, the algorithm is memory efficient and involves less execution ime then the state-of-the art simplification algorithms. This automatically prevents the creation of folds and automatically preserves visually important features of the model even at low levels of detail. LODs generated by our method compare favorably with those produced by the standard QEM-based algorithm QSlim [8] in terms of the mean and maximum geometric errors, whereas its performance in preserving normal space of the original model is better than that of QSlim.