The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2012 vol.18)
pp: 1811-1823
L. Baboud , Max-Planck-Inst. fur Inf., St. Pierre d'Allevard, France
E. Eisemann , TSI, Telecom ParisTech, Paris, France
H-P Seidel , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
ABSTRACT
Height fields have become an important element of realistic real-time image synthesis to represent surface details. In this paper, we focus on the frequent case of static height-field data, for which we can precompute acceleration structures. While many rendering algorithms exist that impose tradeoffs between speed and accuracy, we show that even accurate rendering can be combined with high performance. A careful analysis of the surface defined by the height values, leads to an efficient and accurate precomputation method. As a result, each texel stores a safety shape inside which a ray cannot cross the surface twice. This property ensures that no intersections are missed during the efficient marching method. Our analysis is general and can even consider visibility constraints that are robustly integrated into the precomputation. Further, we propose a particular instance of safety shapes with little memory overhead, which results in a rendering algorithm that outperforms existing methods, both in terms of accuracy and performance.
INDEX TERMS
rendering (computer graphics), image texture, realistic images, image texture, height-field rendering, realistic real-time image synthesis, surface details representation, static height-field data, acceleration structures, precomputed safety shapes, rendering algorithm, precomputation method, marching method, visibility constraints, 3D graphics, Rendering (computer graphics), Safety, Shape, Acceleration, Accuracy, Three dimensional displays, Interpolation, texture, Computer graphics, 3D graphics, realism, raytracing, color, shading, shadowing
CITATION
L. Baboud, E. Eisemann, H-P Seidel, "Precomputed Safety Shapes for Efficient and Accurate Height-Field Rendering", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 11, pp. 1811-1823, Nov. 2012, doi:10.1109/TVCG.2011.281
REFERENCES
[1] C. Dick, J. Krüger, and R. Westermann, "GPU Ray-casting for Scalable Terrain Rendering," Proc. Eurographics, pp. 43-50, 2009.
[2] S. Mantler, S. Jeschke, and M. Wimmer, "Displacement Mapped Billboard Clouds," Technical Report TR-186-2-07-01, Inst. of Comp. Graphics and Algorithms, Vienna Univ. of Tech nology, Jan. 2007.
[3] L. Baboud and X. Décoret, "Realistic Water Volumes in Real-Time," Proc. Eurographics Workshop Natural Phenomena, 2006.
[4] M.M. Oliveira, G. Bishop, and D. McAllister, "Relief Texture Mapping," Proc. SIGGRAPH, pp. 359-368, 2000.
[5] J. Shade, S. Gortler, L. wei He, and R. Szeliski, "Layered Depth Images," Proc. SIGGRAPH, 1998.
[6] S. Parilov and W. Stürzlinger, "Layered Relief Textures," Proc. WSCG, pp. 357-364, 2002.
[7] F. Policarpo and M.M. Oliveira, "Relief Mapping of Non-Height-Field Surface Details," Proc. Symp. Interactive 3D Graphics and Games (I3D '06), pp. 55-62, 2006.
[8] R. de Toledo, B. Wang, and B. Levy, "Geometry Textures," Proc. 20th Brazilian Symp. Computer Graphics and Image Processing (SIBGRAPI '07), pp. 79-86, 2007.
[9] C. Andújar, J. Boo, P. Brunet, M. Fairén, I. Navazo, P. Vázquez, and A. Vinacua, "Omni-Directional Relief Impostors," Computer Graphics Forum, vol. 26, no. 3, pp. 553-560, Sept. 2007.
[10] L. Szirmay-Kalos and T. Umenhoffer, "Displacement Mapping on the GPU—State of the Art," Computer Graphics Forum, vol. 27, no. 6, pp. 1567-1592, 2008.
[11] R.L. Cook, "Shade Trees," Proc. SIGGRAPH, pp. 223-231, 1984.
[12] P. Lindstrom, D. Koller, W. Ribarsky, L. Hodges, N. Faust, and G. Turner, "Real-Time Continuous Level of Detail Rendering of Height Fields," Proc. SIGGRAPH, 1996.
[13] K. Moule and M.D. McCool, "Efficient Bounded Adaptive Tessellation of Displacement Maps," Proc. Graphics Interface, pp. 171-180, 2002.
[14] T. Boubekeur and C. Schlick, "Generic Mesh Refinement on GPU," Proc. ACM SIGGRAPH/EUROGRAPHICS Conf. Graphics Hardware (HWWS '05), pp. 99-104, 2005.
[15] T. Kaneko, T. Takahei, M. Inami, N. Kawakami, Y. Yanagida, T. Maeda, and S. Tachi, "Detailed Shape Representation with Parallax Mapping," Proc. 11th Int'l Conf. Artificial Reality and Telexistence (ICAT '01), pp. 205-208, 2001.
[16] T. Welsh, "Parallax Mapping with Offset Limiting: A Per-pixel Approximation of Uneven Surfaces," technial report, Infiscape Corporation, 2004.
[17] J. Kautz and H.-P. Seidel, "Hardware Accelerated Displacement Mapping for Image Based Rendering," Proc. Graphics Interface (GRIN '01), pp. 61-70, 2001.
[18] J. Hirche, A. Ehlert, S. Guthe, and M. Doggett, "Hardware Accelerated Per-Pixel Displacement Mapping," Proc. Graphics Interface (GI '04), pp. 153-158, 2004.
[19] L. Baboud and X. Décoret, "Rendering Geometry with Relief Textures," Proc. Graphics Interface, 2006.
[20] J. Amanatides and A. Woo, "A Fast Voxel Traversal Algorithm for Ray Tracing," Proc. Eurographics, pp. 3-10, 1987.
[21] F. Policarpo, M.M. Oliveira, and J.L.D. Comba, "Real-Time Relief Mapping on Arbitrary Polygonal Surfaces," Proc. Symp. Interactive 3D Graphics and Games, pp. 155-162, 2005.
[22] L. Szirmay-Kalos, B. Aszódi, I. Lazányi, and M. Premecz, "Approximate Ray-Tracing on the GPU with Distance Impostors," Computer Graphics Forum, vol. 24, no. 3, pp. 695-704, 2005.
[23] A. Tevs, I. Ihrke, and H.-P. Seidel, "Maximum Mipmaps for Fast, Accurate, and Scalable Dynamic Height Field Rendering," Proc. Symp. Interactive 3D Graphics and Games (i3D '08), pp. 183-190, 2008.
[24] L. Wang, X. Wang, X. Tong, S. Lin, S. Hu, B. Guo, and H.-Y. Shum, "View-Dependent Displacement Mapping," ACM Trans. Graphics, vol. 22, no. 3, pp. 334-339, 2003.
[25] X. Wang, X. Tong, S. Lin, S. Hu, B. Guo, and H.-Y. Shum, "Generalized Displacement Maps," Proc. Eurographics Symp. Rendering, pp. 227-234, 2004.
[26] E.H. Adelson and J.R. Bergen, "The Plenoptic Function and the Elements of Early Vision," Proc. Computational Models of Visual Processing, pp. 3-20, 1991.
[27] L. McMillan and G. Bishop, "Plenoptic Modeling: An Image-Based Rendering System," Proc. SIGGRAPH, pp. 39-46, 1995.
[28] W. Donnelly, "Per-Pixel Displacement Mapping with Distance Functions," GPU Gems 2, pp. 123-136, Addison-Wesley 2005.
[29] D.W. Paglieroni, "The Directional Parameter Plane Transform of a Height Field," ACM Trans. Graphics, vol. 17, no. 1, pp. 50-70, 1998.
[30] F. Policarpo and M.M. Oliveira, "Relaxed Cone Stepping for Relief Mapping," GPU Gems 3, ch. 18, pp. 409-428, Addison-Wesley, 2007.
[31] S. Nirenstein, E.H. Blake, and J.E. Gain, "Exact from-Region Visibility Culling," Proc. Rendering Techniques, pp. 191-202, 2002.
[32] M. Levoy and P. Hanrahan, "Light Field Rendering," Proc. SIGGRAPH, pp. 31-42, 1996.
[33] X. Gu, S.J. Gortler, and M.F. Cohen, "Polyhedral Geometry and the Two-Plane Parameterization," Proc. Eurographics Workshop Rendering Techniques, pp. 1-12, 1997.
[34] J. Bittner, J. Prikryl, and P. Slavík, "Exact Regional Visibility Using Line Space Partitioning," Computers and Graphics, vol. 27, no. 4, pp. 569-580, 2003.
[35] X. Décoret, "N-Buffers for Efficient Depth Map Query," Computer Graphics Forum, vol. 24, no. 3, pp. 393-400, 2005.
[36] C. Loop and J. Blinn, "Real-Time GPU Rendering of Piecewise Algebraic Surfaces," ACM Trans. Graphics, vol. 25, no. 3, pp. 664-670, 2006.
[37] E. Risser, M. Shah, and S. Pattanaik, "Faster Relief Mapping Using the Secant Method," J. Graphics Tools, vol. 12, no. 3, pp. 17-24, 2007.
52 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool