This Article 
 Bibliographic References 
 Add to: 
Compressed Facade Displacement Maps
March/April 2009 (vol. 15 no. 2)
pp. 262-273
Saif Ali, AMD, Santa Clara
Jieping Ye, Arizona State University, Tempe
Anshuman Razdan, Arizona State University, Tempe
Peter Wonka, Arizona State University, Tempe
We describe an approach to render massive urban models. To prevent a memory transfer bottleneck we propose to render the models from a compressed representation directly. Our solution is based on rendering crude building outlines as polygons and generating details by ray-tracing displacement maps in the fragment shader. We demonstrate how to compress a displacement map so that a decompression algorithm can selectively and quickly access individual entries in a fragment shader. Our prototype implementation shows how a massive urban model can be compressed by a factor of $85$ and outperform a basic geometry-based renderer by a factor of $50$ to $100$ in rendering speed.

[1] D.W. Paglieroni and S.M. Petersen, “Height Distributional Distance Transform Methods for Height Field Ray Tracing,” ACM Trans. Graphics, vol. 13, no. 4, pp. 376-399, 1994.
[2] W. Donnelly, “Per-Pixel Displacement Mapping with Distance Functions,” GPU Gems 2, 2005.
[3] J. Kautz and M.D. McCool, “Interactive Rendering with Arbitrary BRDFs Using Separable Approximations,” Proc. Eurographics Workshop Rendering Techniques, 253-253, 1999.
[4] L. Borgeat, G. Godin, F. Blais, P. Massicotte, and C. Lahanier, “GoLD: Interactive Display of Huge Colored and Textured Models,” ACM Trans. Graphics, vol. 26, no. 3, pp. 869-877, July 2005.
[5] E. Gobbetti and F. Marton, “Far Voxels: A Multiresolution Framework for interactive Rendering of Huge Complex 3D Models on Commodity Graphics Platforms,” ACM Trans. Graphics, vol. 24, no. 3, pp. 878-885, July 2005.
[6] P. Lindstrom, D. Koller, W. Ribarsky, L.F. Hodges, N. Faust, and G.A. Turner, “Real-Time, Continuous Level of Detail Rendering of Height Fields,” Proc. ACM SIGGRAPH '96, pp. 109-118, 1996.
[7] F. Losasso and H. Hoppe, “Geometry Clipmaps: Terrain Rendering Using Nested Regular Grids,” ACM Trans. Graphics, vol. 23, no. 3, pp. 769-776, Aug. 2004.
[8] E. Gobbetti, F. Marton, P. Cignoni, M.D. Benedetto, and F. Ganovelli, “C-BDAM—Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering,” Computer Graphics Forum, vol. 25, no. 3, Sept. 2006.
[9] F. Musgrave, “Grid Tracing: Fast Ray Tracing for Height Fields,” technical report, 1988.
[10] D.W. Paglieroni, “The Directional Parameter Plane Transform of a Height Field,” ACM Trans. Graphics, vol. 17, no. 1, pp. 50-70, 1998.
[11] C.-H. Lee and Y.-G. Shin, “A Terrain Rendering Method Using Vertical Ray Coherence,” J. Visualization and Computer Animation, vol. 8, no. 2, pp. 97-114, 1997.
[12] B.E. Smits, P. Shirley, and M.M. Stark, “Direct Ray Tracing of Displacement Mapped Triangles,” Proc. Eurographics Workshop Rendering Techniques, pp. 307-318, 2000.
[13] R.L. Cook, “Shade Trees,” Proc. ACM SIGGRAPH '84, pp. 223-231, 1984.
[14] J.F. Blinn, “Simulation of Wrinkled Surfaces,” Proc. ACM SIGGRAPH '78, pp. 286-292, 1978.
[15] S. Gumhold and T. Huettner, “Multiresolution Rendering with Displacement Mapping,” Proc. ACM SIGGRAPH/Eurographics Workshop Graphics Hardware (HWWS '99), pp. 55-66, 1999.
[16] M. Doggett and J. Hirche, “Adaptive View Dependent Tessellation of Displacement Maps,” Proc. ACM SIGGRAPH/Eurographics Workshop Graphics Hardware (HWWS '00), pp. 59-66, 2000.
[17] K. Moule and M.D. McCool, “Efficient Bounded Adaptive Tessellation of Displacement Maps,” Proc. Conf. Graphics Interface (GI '02), pp. 171-180, May 2002.
[18] J. Hirche, A. Ehlert, S. Guthe, and M. Doggett, “Hardware Accelerated Per-Pixel Displacement Mapping,” Proc. Conf. Graphics Interface (GI '04), pp. 153-158, 2004.
[19] F. Policarpo, M.M. Oliveira, and A.L.D.C. Jo, “Real-Time Relief Mapping on Arbitrary Polygonal Surfaces,” Proc. ACM SIGGRAPH Symp. Interactive 3D Graphics and Games (I3D'05), pp. 155-162, 2005.
[20] E.A. Risser, M.A. Shah, and S. Pattanaik, “Interval Mapping,” technical report, School of Eng. and Computer Science, Univ. of Central Florida, 2006.
[21] L. Baboud and X. Décoret, “Rendering Geometry with Relief Textures,” Proc. Conf. Graphics Interface (GI '06), pp. 195-201, 2006.
[22] J. Dummer, “Cone Step Mapping: An Iterative Ray-Heightfield Intersection Algorithm,” technical report, http://www.lonesock. net/filesConeStepMapping.pdf , 2006.
[23] 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.
[24] N. Tatarchuk, “Dynamic Parallax Occlusion Mapping with Approximate Soft Shadows,” Proc. ACM SIGGRAPH Symp. Interactive 3D Graphics and Games (I3D '06), pp. 63-69, 2006.
[25] G.H. Golub and C.F. Van Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
[26] I.T. Jolliffe, Principal Component Analysis. Springer, 1986.
[27] A. Fournier, “Separating Reflection Functions for Linear Radiosity,” Proc. Eurographics Workshop Rendering Techniques, pp. 296-305, 1995.
[28] R. Wang, J. Tran, and D.P. Luebke, “All-Frequency Relighting of Non-Diffuse Objects Using Separable BRDF Approximation,” Proc. 15th Eurographics Workshop Rendering Techniques, pp. 345-354, 2004.
[29] M. Alexa and W. Müller, “Representing Animations by Principal Components,” Computer Graphics Forum, vol. 19, no. 3, 2000.
[30] K. Nishino, Y. Sato, and K. Ikeuchi, “Eigen-Texture Method: Appearance Compression Based on 3D Model,” Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR '99), pp. 618-624, 1999.
[31] M. Turk and A. Pentland, “Eigenfaces for Recognition,” J. Cognitive Neuroscience, vol. 3, no. 1, pp. 71-86, 1991.
[32] J. Lehtinen and J. Kautz, “Matrix Radiance Transfer,” Proc. ACM SIGGRAPH Symp. Interactive 3D Graphics (I3D '03), pp. 59-64, Apr. 2003.
[33] L. Latta and A. Kolb, “Homomorphic Factorization of BRDF-Based Lighting Computation,” Proc. ACM SIGGRAPH '02, pp. 509-516, 2002.
[34] M.D. McCool, J. Ang, and A. Ahmad, “Homomorphic Factorization of BRDFs for High-Performance Rendering,” Proc. ACM SIGGRAPH '01, pp. 171-178, 2001.
[35] F. Suykens, K. vom Berge, A. Lagae, and P. Dutré, “Interactive Rendering with Bidirectional Texture Functions,” Computer Graphics Forum, vol. 22, no. 3, pp. 463-472, Sept. 2003.
[36] D.D. Lee and H.S. Seung, Algorithms for Non-Negative Matrix Factorization, pp. 556-562. MIT Press, 2000.
[37] J. Lawrence, S. Rusinkiewicz, and R. Ramamoorthi, “Efficient BRDF Importance Sampling Using a Factored Representation,” ACM Trans. Graphics, vol. 23, no. 3, pp. 496-505, 2004.
[38] J. Lawrence, A. Ben-Artzi, C. DeCoro, W. Matusik, H. Pfister, R. Ramamoorthi, and S. Rusinkiewicz, “Inverse Shade Trees for Non-Parametric Material Representation and Editing,” ACM Trans. Graphics, vol. 25, no. 3, pp. 735-745, 2006.
[39] P. Peers, K. vom Berge, W. Matusik, R. Ramamoorthi, J. Lawrence, S. Rusinkiewicz, and P. Dutré, “A Compact Factored Representation of Heterogeneous Subsurface Scattering,” ACM Trans. Graphics, vol. 25, no. 3, pp. 746-753, 2006.
[40] P.-P.J. Sloan, J. Hall, J.C. Hart, and J. Snyder, “Clustered Principal Components for Precomputed Radiance Transfer,” ACM Trans. Graphics, vol. 22, no. 3, pp. 382-391, 2003.
[41] A.W. Kristensen, T. Akenine-Möller, and H.W. Jensen, “Precomputed Local Radiance Transfer for Real-Time Lighting Design,” ACM Trans. Graphics, vol. 24, no. 3, pp. 1208-1215, 2005.
[42] M. Sattler, R. Sarlette, and R. Klein, “Simple and Efficient Compression of Animation Sequences,” Proc. ACM SIGGRAPH/Eurographics Symp. Computer Animation (SCA '05), pp. 209-218, 2005.
[43] O. Arikan, “Compression of Motion Capture Databases,” ACM Trans. Graphics, vol. 25, no. 3, pp. 890-897, , 2006.
[44] J. Ricard, J. Royan, and O. Aubault, “From Photographs to Procedural Facade Models,” ACM SIGGRAPH '07, p. 75, 2007.
[45] P. Müller, G. Zeng, P. Wonka, and L.V. Gool, “Image-Based Procedural Modeling of Facades,” ACM Trans. Graphics, vol. 24, no. 3, p. 85, 2007.
[46] G. Schaufler, J. Dorsey, X. Decoret, and F. Sillion, “Conservative Volumetric Visibility with Occluder Fusion,” Proc. ACM SIGGRAPH '00, pp. 229-238, 2000.
[47] Y.I.H. Parish and P. Müller, “Procedural Modeling of Cities,” Proc. ACM SIGGRAPH '01, E. Fiume, ed., pp. 301-308, 2001.
[48] W.H. Press, W.T. Vetterling, S.A. Teukolsky, and B.P. Flannery, Numerical Recipes in C++: The Art of Scientific Computing, 2002.
[49] M. Koyutürk and A. Grama, “PROXIMUS: A Framework for Analyzing Very High Dimensional Discrete-Attributed Datasets,” Proc. ACM SIGKDD '03, pp. 147-156, 2003.
[50] T. Kolda and D. O'Leary, “A Semidiscrete Matrix Decomposition for Latent Semantic Indexing Information Retrieval,” ACM Trans. Information Systems, vol. 16, no. 4, pp. 322-346, 1998.
[51] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[52] D. Blythe, “The Direct3d 10 System,” ACM Trans. Graphics, vol. 25, no. 3, pp. 724-734, 2006.
[53] C. Sturtivant, Finding the Right One, / 2006/12finding_the_right_one.html , 2008.

Index Terms:
Display algorithms, Raytracing, Displacement Mapping, GPU Raytracing
Saif Ali, Jieping Ye, Anshuman Razdan, Peter Wonka, "Compressed Facade Displacement Maps," IEEE Transactions on Visualization and Computer Graphics, vol. 15, no. 2, pp. 262-273, March-April 2009, doi:10.1109/TVCG.2008.98
Usage of this product signifies your acceptance of the Terms of Use.