Smooth transitions between bump rendering algorithms
- California Univ., Davis, CA (United States)
- (United States)
A method is described for 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 bump maps. The three rendering algorithms considered are bidirectional reflection distribution function (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. Thus, it needs to be determined for any given viewpoint which regions of the object(s) will be rendered with each algorithm The decision as to which algorithm is appropriate is a function of distance, viewing angle, and the frequency of bumps in the bump map.
- Research Organization:
- Lawrence Livermore National Lab., CA (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 10156902
- Report Number(s):
- UCRL-JC-112601; CONF-930881-2; ON: DE93012504
- Resource Relation:
- Conference: Siggraph `93: special interest group on graphics conference,Anaheim, CA (United States),2-6 Aug 1993; Other Information: PBD: 4 Jan 1993
- Country of Publication:
- United States
- Language:
- English
Similar Records
Bidirectional Reflection Distribution Functions from surface bump maps
A task adaptive parallel graphics rendering algorithm