Feature-based Displacement Mapping
Displacement mapping was originally created as a rendering tool to provide small-scale modulation of an underlying smooth surface. However, it has now emerged as a sculpting tool, to the extent that complex geometry can effectively be added to a scene at rendering time. The attendant complexity of displacement maps is placing increased demands on rendering systems, from quality, performance, and memory perspectives. While adequate solutions exist within scanline rendering architectures, good general solutions have been difficult to come by in ray-traced or hardware-based environments, or in situations in which a complete displaced surface is desired. We present an approach to the rendering of displacement mapped surfaces that scales with the complexity of the displacement map, with an eye to minimizing the amount of additional geometry generated by the mapping process. We perform a feature analysis of displacement maps, aggregate these features, and map them onto geometry in space. This approach affords a significant degree of complexity control, it permits feature-based tessellation of surfaces, and it is amenable to use in ray-traced, scanline, or hardware accelerated settings. This kind of feature analysis naturally applies to other classes of texture mapping as well.
KeywordsFeature Point Computer Graphic Height Field Bump Mapping Vertex Normal
Unable to display preview. Download preview PDF.
- 1.Alias—Wavefront. Maya 2.5 software, http://www.aliaswavefront.com/.
- 2.A.A. Apodaca, L. Gritz. Advanced Render Man. Morgan Kaufmann Publishers, pages 153 and 155, 2000.Google Scholar
- 3.B.G. Becker, N.L. Max. Smooth Transitions between Bump Rendering Algorithms. Computer Graphics (Proc. Siggraph ’93), 183–189, August, 1993.Google Scholar
- 4.J.F. Blinn. Simulation of Wrinkled Surfaces. Computer Graphics (Proc. Siggraph ’78), 286–292, August, 1978.Google Scholar
- 5.E. Catmull. Computer Display of Curved Surfaces. Proceedings of the IEEE conference on Computer Graphics, Pattern Recognition and Data Structures, 11, May, 1975.Google Scholar
- 6.R.L. Cook. Shade trees. Computer Graphics (Proc. Siggraph ’84), 223–231, July, 1984.Google Scholar
- 7.R.L. Cook, L. Carpenter, E. Catmull. The Reyes Image Rendering Architecture. Computer Graphics (Proc. Siggraph ’87), 95–102, July, 1987.Google Scholar
- 8.W. Heidrich, H.P. Seidel. Ray-Tracing Procedural Displacement Shaders. Graphics Interface ’98, 8–16, June, 1998.Google Scholar
- 9.H. Hoppe. Progressive Meshes. Computer Graphics (Proc. Siggraph ’96), 99–108, August, 1996.Google Scholar
- 10.H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, W. Stuetzle. Surface Reconstruction from Unorganized Points. Computer Graphics (Proc. Siggraph ’92), 71–78, July, 1992.Google Scholar
- 12.F. Kenton Musgrave. Grid Tracing: Fast Ray Tracing for Height Fields. Technical Report YALEU/DCS/RR-639, Yale University, Dept. of Computer Science Research, July, 1988.Google Scholar
- 13.P. Lindstrom, D. Koller, W. Ribarsky, L.F. Hodges, N. Faust, G.A. Turner. Real-Time, Continuous Level of Detail Rendering of Height Fields. Computer Graphics (Proc. Siggraph ’96), 109–118, August, 1996.Google Scholar
- 14.W.E. Lorensen. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics (Proc. Siggraph ’87), 163–169, July, 1987.Google Scholar
- 16.M. Pharr, P. Hanrahan. Geometry caching for ray-tracing displacement maps. Eurographics Rendering Workshop 1996, Porto, Portugal, Springer Verlag, Vienna, 31–40, June, 1996.Google Scholar
- 17.Pixar. PRman software.Google Scholar
- 19.J.R. Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulation. First Workshop on Applied Computational Geometry (Philadelphia, Pennsylvania), pages 124–133, ACM, May, 1996.Google Scholar