Abstract
This paper presents a new method for solving the following problem: Given a polygonal model of some geometric object generate several more and more approximative representations of this object containing less and less polygons. The idea behind the method is that small detail in the model is represented by many spatially close points. A hierarchical clustering algorithm is used to generate a hierarchy of clusters from the vertices of the object’s polygons. The coarser the approximation the more points are found to lie within one cluster of points. Each cluster is replaced by one representative point and polygons are reconstructed from these points. A static detail elision algorithm was implemented to prove the practicability of the method. This paper shows examples of approximations generated from different geometry models, pictures of scenes rendered by a detail elision algorithm and timings of the method at work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Simplification of Objects Rendered-Polygonal Approximations. Michael J. DeHaemer, Jr. and Michael J. Zyda. Computers & Graphics Vol. 15, No. 2 pp 175–184, 1991.
Adaptive Display Algorithm for Interactive Frame Rates During Visualization of Complex Virtual Environments. Thomas A. Funkhouser, Carlo H. Séquin. SIG-GRAPH 93, Computer Graphics Proceedings, pp 247–254, 1993.
Piecewise Smooth Surface Reconstruction. Hugues Hoppe, Tony DeRose, Tom Duchamp, Mark Halstead, Hubert Jun, Jon McDonald, Jean Schweitzer, Werner Stuetzle. Sigcjraph 94, Computer Graphics Proceedings, pp 295–302, 1994.
A Survey of lUcent/dances in Hierarchical Clustering Algorithms. F. Mur-tagh. The Computer Journal, Vol. 26, No. 4, 1983.
IRIS Performer: A High Performance Multiprocessing Toolkit for Real-Time 3D Graphics. John Rohlf, James Helman. SIGGRAPH 94, Computer Graphics Pro-ceedings, pp 381–394, 1994.
Multi-Resolution 3D Approximations for Rendering Complex Scenes. J. R. Ros-signac, P. Borrel. Computer Science, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, 2 1992.
Geometric Simplification for Indirect Illumination Calculations. Holly Rushmeier, Charles Patterson, Aravindan Veerasamy. Proceedings of Graphics Interface ’93, 1993.
Numerical Taxonomy; The Principles and Practice of Numerical Classification. Peter H. A. Sneath, Robert R. Sokal. Publisher W. H. Freeman, San Francisco, 1973.
Re-Tiling Polygonal Surfaces. Greg Turk. SIGGRAPH 92, Computer Graphics Proceedings, pp 55–64, 1992.
Decimation of Triangle Meshes. William J. Schroeder, Jonathan A. Targe, William E. Lorensen. SIGGRAPH 92, Computer Graphics Proceedings, pp 65–70, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Schaufler, G., Stürzlinger, W. (1995). Generating Multiple Levels of Detail from Polygonal Geometry Models. In: Göbel, M. (eds) Virtual Environments ’95. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9433-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9433-1_4
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82737-6
Online ISBN: 978-3-7091-9433-1
eBook Packages: Springer Book Archive