Management of large amounts of data in interactive building walkthroughs
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Visual navigation of large environments using textured clusters
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Level-of-detail generation and its application in virtual reality
VRST '94 Proceedings of the conference on Virtual reality software and technology
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Strategies for polyhedral surface decomposition: an experimental study
Proceedings of the eleventh annual symposium on Computational geometry
Hierarchical geometric approximations
Hierarchical geometric approximations
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
Hierarchical geometric models for visible surface algorithms
Communications of the ACM
Polygonal Simplification: An Overview
Polygonal Simplification: An Overview
VIS '93 Proceedings of the 4th conference on Visualization '93
Mesh simplification for QoS control in 3D web environment
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Error metric for perceptual features preservation in polygonal surface simplification
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
| Hi-index | 0.00 |
This paper covers the techniques of Polygonal Simplification in order to produce Levels of Detail (LODs). The problem of creating LODs is a complex one: how can simpler versions of a model be created? How can the approximation error be measured? How can the visual degradation be estimated? Can all this be done automatically? After exposing the basic aims and principles of polygonal simplification, we compare recent algorithms and state their various qualities and weaknesses.