Smooth transitions between bump rendering algorithms

A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation for displaying objects whose surface detail can be described by one or more bumpmaps. The three rendering algorithms considered are a BRDF, bump mapping, and displacement mapping. The bump mapping has been modified to make it consistent with the other two. For a given viewpoint, one of these algorithms will show a better trade-off between quality, computation time, and aliasing than the other two. The decision as to which algorithm is appropriate is a function of distance, viewing angle, and the frequency of bumps in the bump map. CR Categories: I.3.3 [Computer Graphics]: Picture/Image Generation; I.3.5 [Computer Graphics]: Three-Dimensional Graphics and Realism.

• Type: Conference
• Year: 1993
• Where: SIGGRAPH
• Authors: Barry G. Becker, Nelson L. Max
• Keywords: Algorithm, Bump Mapping, Computer Graphics, SIGGRAPH 1993, Visible Surface Detail