Subscribe

Issue No.03 - May/June (2001 vol.21)

pp: 24-35

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.920624

ABSTRACT

Polygonal simplification, also known as level of detail, is an important tool for anyone doing interactive rendering, but how is a developer to choose among the dozens of published algorithms? This article surveys the field from a developer's point of view, attempting to identify the issues in picking an algorithm, relate the strengths and weaknesses of different approaches, and describe a number of published algorithms as examples.

CITATION

David P. Luebke, "A Developer's Survey of Polygonal Simplification Algorithms",

*IEEE Computer Graphics and Applications*, vol.21, no. 3, pp. 24-35, May/June 2001, doi:10.1109/38.920624REFERENCES

- 15. J. Rossignac and P. Borrel, "Multi-Resolution 3D Approximations for Rendering Complex Scenes,"
Geometric Modeling in Computer Graphics, Springer-Verlag, Berlin, 1993, pp. 455-465.- 21. H. Hoppe, “View-Dependent Refinement of Progressive Meshes,”
Proc. SIGGRAPH '97, pp. 189-198, 1997. |