Smooth transitions in texture-based simplification

We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, textures have been used to replace complex geometry, for example the books on a shelf or the complex foliage on a tree. Using textures in a more general manner is a relatively new area of research. The key idea is that 2D image textures can be used to temporarily represent 3D geometry. Rendering speed is increased if a replacement texture can be used for several frames, since textures can be rendered quickly and independently of model complexity. Because a texture is only correct from a single viewpoint, visual discontinuities, such as misalignment with adjacent geometry, begin to appear as the texture is used from other viewpoints. Previous approaches have controlled these errors by re-rendering the textures often or providing a large set of precomputed textures. We have improved upon these methods by developing algorithms for: (a) providing continuous imagery across borders between geometry and sampled textures at all times; (b) providing smooth dynamic transitions between geometry and texture.

[1]  Leonard McMillan,et al.  Plenoptic Modeling: An Image-Based Rendering System , 2023 .

[2]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

[3]  Peter Shirley,et al.  Visual navigation of large environments using textured clusters , 1995, I3D '95.

[4]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

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

[6]  Daniel G. Aliaga,et al.  Architectural walkthroughs using portal textures , 1997 .

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

[8]  Anselmo Lastra,et al.  3D image warping in architectural walkthroughs , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[9]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[10]  Wolfgang Stuerzlinger,et al.  A Three Dimensional Image Cache for Virtual Reality , 1996, Comput. Graph. Forum.

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

[12]  Anselmo Lastra,et al.  Real-time programmable shading , 1995, I3D '95.

[13]  Dinesh Manocha,et al.  Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.

[14]  David P. Luebke,et al.  Portals and mirrors: simple, fast evaluation of potentially visible sets , 1995, I3D '95.

[15]  Daniel G. Aliaga Visualization of complex models using dynamic texture-based simplification , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[16]  Dinesh Manocha,et al.  Accelerated walkthrough of large spline models , 1997, SI3D.

[17]  Shenchang Eric Chen,et al.  QuickTime VR: an image-based approach to virtual environment navigation , 1995, SIGGRAPH.

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

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

[20]  David P. Luebke,et al.  View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.

[21]  David Salesin,et al.  Hierarchical image caching for accelerated walkthroughs of complex environments , 1996, SIGGRAPH.

[22]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

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

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

[25]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.