Levels of detail & polygonal simplification
- 1 May 1997
- journal article
- Published by Association for Computing Machinery (ACM) in XRDS: Crossroads, The ACM Magazine for Students
- Vol. 3 (4) , 13-19
- https://doi.org/10.1145/270955.270966
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- SCROOGE:Perceptually‐Driven Polygon ReductionComputer Graphics Forum, 1996
- Simplification envelopesPublished by Association for Computing Machinery (ACM) ,1996
- Progressive meshesPublished by Association for Computing Machinery (ACM) ,1996
- A survey of level of detail support in current virtual reality solutionsVirtual Reality, 1995
- Multiresolution analysis of arbitrary meshesPublished by Association for Computing Machinery (ACM) ,1995
- Visual navigation of large environments using textured clustersPublished by Association for Computing Machinery (ACM) ,1995
- Mesh optimizationPublished by Association for Computing Machinery (ACM) ,1993
- Management of large amounts of data in interactive building walkthroughsPublished by Association for Computing Machinery (ACM) ,1992
- Simplification of objects rendered by polygonal approximationsComputers & Graphics, 1991
- Hierarchical geometric models for visible surface algorithmsCommunications of the ACM, 1976