The Community for Technology Leaders
Green Image
Issue No. 11 - Nov. (2012 vol. 18)
ISSN: 1077-2626
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
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.
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

H. Seidel, E. Eisemann and L. Baboud, "Precomputed Safety Shapes for Efficient and Accurate Height-Field Rendering," in IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 1811-1823, 2012.
184 ms
(Ver 3.3 (11022016))