Multiresolution Modeling for Fast Rendering

Three dimensional scenes are typically modeled using a single, fixed resolution model of each geometric object. Renderings of such a model are often either slow or crude, however: slow for distant objects, where the chosen detail level is excessive, and crude for nearby objects, where the detail level is insufficient. What is needed is a multiresolution model that represents objects at multiple levels of detail. With a multiresolution model, a rendering program can choose the level of detail appropriate for the object’s screen size so that less time is wasted drawing insignificant detail. The principal challenge is the development of algorithms that take a detailed model as input and automatically simplify it, while preserving appearance. Multiresolution techniques can be used to speed many applications, including real time rendering for architectural and terrain simulators, and slower, higher quality rendering for entertainment and radiosity. This paper surveys existing multiresolution modeling techniques and speculates about what might be possible in the future.

[1]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[2]  Lance Williams,et al.  Pyramidal parametrics , 1983, SIGGRAPH.

[3]  Azriel Rosenfeld,et al.  Multiresolution image processing and analysis , 1984 .

[4]  James T. Kajiya,et al.  Anisotropic reflection models , 1985, SIGGRAPH.

[5]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Paul S. Heckbert,et al.  Survey of Texture Mapping , 1986, IEEE Computer Graphics and Applications.

[7]  Nelson L. Max,et al.  Bidirectional reflection functions from surface bump maps , 1987, SIGGRAPH.

[8]  B. Naylor,et al.  Piecewise linear approximations of digitized space curves with applications , 1991 .

[9]  Michael Zyda,et al.  Simplification of objects rendered by polygonal approximations , 1991, Comput. Graph..

[10]  Pat Hanrahan,et al.  A rapid hierarchical radiosity algorithm , 1991, SIGGRAPH.

[11]  Georgios Sakas,et al.  Sampling and anti-aliasing of discrete 3-D volume density textures , 1991, Comput. Graph..

[12]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[13]  Stephen H. Westin,et al.  Predicting reflectance functions from complex surfaces , 1992, SIGGRAPH.

[14]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[15]  Theodosios Pavlidis,et al.  Hierarchical triangulation using cartographic coherence , 1992, CVGIP Graph. Model. Image Process..

[16]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[17]  Carlo H. Séquin,et al.  Management of large amounts of data in interactive building walkthroughs , 1992, I3D '92.

[18]  Carlo H. Séquin,et al.  Database and display algorithms for interactive visualization of architectural models , 1993 .

[19]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[20]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[21]  Nelson L. Max,et al.  Smooth transitions between bump rendering algorithms , 1993, SIGGRAPH.

[22]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[23]  Lance Williams,et al.  View Interpolation for Image Synthesis , 1993, SIGGRAPH.

[24]  James H. Clark.  Hierarchical geometric models for visible surface algorithms , 1998 .

[25]  Michael,et al.  Issues in Iterative TIN Generation to Support Large Scale Simulations , .