
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Daniel CohenOr, Yiorgos L. Chrysanthou, Cl?udio T. Silva, Fr?do Durand, "A Survey of Visibility for Walkthrough Applications," IEEE Transactions on Visualization and Computer Graphics, vol. 9, no. 3, pp. 412431, JulySeptember, 2003.  
BibTex  x  
@article{ 10.1109/TVCG.2003.1207447, author = {Daniel CohenOr and Yiorgos L. Chrysanthou and Cl?udio T. Silva and Fr?do Durand}, title = {A Survey of Visibility for Walkthrough Applications}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {9}, number = {3}, issn = {10772626}, year = {2003}, pages = {412431}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2003.1207447}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  A Survey of Visibility for Walkthrough Applications IS  3 SN  10772626 SP412 EP431 EPD  412431 A1  Daniel CohenOr, A1  Yiorgos L. Chrysanthou, A1  Cl?udio T. Silva, A1  Fr?do Durand, PY  2003 KW  Visibility computations KW  interactive rendering KW  occlusion culling KW  walkthrough systems. VL  9 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—Visibility algorithms for walkthrough and related applications have grown into a significant area, spurred by the growth in the complexity of models and the need for highly interactive ways of navigating them. In this survey, we review the fundamental issues in visibility and conduct an overview of the visibility culling techniques developed in the last decade. The taxonomy we use distinguishes between pointbased and fromregion methods. Pointbased methods are further subdivided into object and imageprecision techniques, while fromregion approaches can take advantage of the cellandportal structure of architectural environments or handle generic scenes.
[1] J. Airey, Increasing Update Rates in the Building Walkthrough System with Automatic ModelSpace Subdivision and Potentially Visible Set Calculations PhD thesis, Univ. of North Carolina, Chappel Hill, 1991.
[2] J.M. Airey, J.H. Rohlf, and F.P. Brooks Jr., Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments Computer Graphics (1990 Symp. Interactive 3D Graphics), vol. 24, no. 2, pp. 4150, Mar. 1990.
[3] D. Aliaga, J. Cohen, A. Wilson, E. Baker, H. Zhang, C. Erikson, K. Hoff, T. Hudson, W. Stuerzlinger, R. Bastos, M. Whitton, F. Brooks, and D. Manocha, MMR: An Interactive Massive Model Rendering System Using Geometric and ImageBased Acceleration Proc. ACM Symp. Interactive 3D Graphics, pp. 199206, 1999.
[4] C. Andujar, C. SaonaVazquez, I. Navazo, and P. Brunet, Integrating Occlusion Culling and Levels of Details through HardlyVisible Sets Computer Graphics Forum, vol. 19, no. 3, pp. 499506, 2000.
[5] A. Appel, Some Techniques for Shading Machine Renderings of Solids Proc. AFIPS 1968 Spring Joint Computer Conf., vol. 32, pp. 3745, 1968.
[6] U. Assarsson and T. Möller, Optimized View Frustum Culling Algorithms for Bounding Boxes J. Graphics Tools, vol. 5, no. 1, pp. 922, 2000.
[7] K. Bala, J. Dorsey, and S. Teller, Radiance Interpolants for Accelerated BoundedError Ray Tracing ACM Trans. Graphics, vol. 18, no. 3, pp. 213256, July 1999.
[8] K. Bala, J. Dorsey, and S. Teller, RayTraced Interactive Scene Editing Using Ray Segment Trees Proc. Eurographics Rendering Workshop 1999, June 1999.
[9] D. Bartz, J. Klosowski, and D. Staneker, kdops as Tighter Bounding Volumes for Better Occlusion Performance ACM SIGGRAPH Visual Proc. 2001, 2001.
[10] D. Bartz, M. Meiner, and T. Httner, OpenglAssisted Occlusion Culling for Large Polygonal Models Computer&Graphics, vol. 23, no. 5, pp. 667679, 1999.
[11] D. Bartz, M. Messner, and T. Httner, Extending Graphics Hardware for Occlusion Queries in Opengl Proc. Workshop Graphics Hardware '98, pp. 97104, 1998.
[12] F. Bernardini, J.T. Klosowski, and J. ElSana, Directional Discretized Occluders for Accelerated Occlusion Culling Computer Graphics Forum, vol. 19, no. 3, pp. 507516, 2000.
[13] J. Bittner, V. Havran, and P. Slavik, Hierarchical Visibility Culling with Occlusion Trees Proc. Computer Graphics Int'l '98, pp. 207219, June 1998.
[14] P. Brunet, I. Navazo, J. Rossignac, and C. SaonaVázquez, Hoops: 3D Curves as Conservative Occluders for CellVisibility Computer Graphics Forum, vol. 20, no. 3, pp. 431442, 2001.
[15] E. Catmull, A Subdivision Algorithm for Computer Display of Curved Surfaces PhD thesis, Univ. of Utah, Dec. 1974.
[16] N. Chin and S. Feiner, Near RealTime Shadow Generation Using BSP Trees ACM Computer Graphics, vol. 23, no. 3, pp. 99106, 1989.
[17] F.S. Cho and D. Forsyth, Interactive Ray Tracing with the Visibility Complex Computer&Graphics, vol. 23, no. 5, pp. 703717, 1999.
[18] Y. Chrysanthou, Shadow Computation for 3D Interaction and Animation PhD thesis, Queen Mary and Westfield College, Univ. of London, Feb. 1996.
[19] J.H. Clark, Hierarchical Geometric Models for Visible Surface Algorithms Comm. ACM, vol. 19, no. 10, pp. 547554, Oct. 1976.
[20] D. CohenOr, G. Fibich, D. Halperin, and E. Zadicario, Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes Computer Graphics Forum, vol. 17, no. 3, pp. 243254, 1998.
[21] D. CohenOr, E. Rich, U. Lerner, and V. Shenkar, A RealTime PhotoRealistic Visual Flythrough IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 3, pp. 255264, Sept. 1996.
[22] D. CohenOr and A. Shaked, Visibility and DeadZones in Digital Terrain Maps Computer Graphics Forum, vol. 14, no. 3, pp. 171180, Aug. 1995.
[23] D. CohenOr and E. Zadicario, Visibility Streaming for NetworkBased Walkthroughs Proc. Graphics Interface '98, pp. 17, June 1998.
[24] S. Coorg and S. Teller, Temporally Coherent Conservative Visibility Proc. 12th Ann. ACM Symp. Computer Geometry, pp. 7887, 1996.
[25] S. Coorg and S. Teller, RealTime Occlusion Culling for Models with Large Occluders Proc. 1997 Symp. Interactive 3D Graphics, pp. 8390, Apr. 1997.
[26] R. Cunniff, Visualize fx Graphics Scalable Architecture Hot3D Proc. (talk), Graphics Hardware Workshop, 2000.
[27] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Berlin: SpringerVerlag, 1997.
[28] D.P. Dobkin and S. Teller, Computer Graphics Handbook of Discrete and Computational Geometry, J.E. Goodman and J. O'Rourke, eds., chapter 42, pp. 779796, Boca Raton, Fla.: CRC Press LLC, 1997.
[29] S.E. Dorward, A Survey of ObjectSpace Hidden Surface Removal Int'l J. Computational Geometry Applications, vol. 4, pp. 325362, 1994.
[30] F. Durand, 3D Visibility: Analytical Study and Applications PhD thesis, UniversitéJoseph Fourier, Grenoble, France, July 1999.
[31] F. Durand, G. Drettakis, J. Thollot, and C. Puech, Conservative Visibility Preprocessing Using Extended Projections Proc. SIGGRAPH 2000, pp. 239248, July 2000.
[32] D.W. Eggert, K.W. Bowyer, and C.R. Dyer, Aspect Graphs: StateoftheArt and Applications in Digital Photogrammetry Proc. ISPRS 17th Congress: Int'l Archives Photogrammetry Remote Sensing, pp. 633645, 1992.
[33] J. ElSana, N. Sokolovsky, and C.T. Silva, Integrating Occlusion Culling with ViewDependent Rendering Proc. IEEE Visualization 2001, pp. 371378, Oct. 2001.
[34] S. Fleishman, D. CohenOr, and D. Lischinski, Automatic Camera Placement for ImageBased Modeling Proc. Pacific Graphics '99, pp. 1220, Oct. 1999.
[35] J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes, Computer Graphics, Principles and Practice, second ed. Reading, Mass.: AddisonWesley, 1990.
[36] T.A. Funkhouser, Database Management for Interactive Display of Large Architectural Models Graphics Interface, pp. 18, May 1996.
[37] T.A. Funkhouser and C.H. Séquin, Adaptive Display Algorithm for Interactive Frame Rates during Visualization of Complex Virtual Environments Proc. ACM SIGGRAPH '93, Computer Graphics Proc., Ann. Conf. Series, pp. 247254, Aug. 1993.
[38] T.A. Funkhouser, C.H. Séquin, and S.J. Teller, Management of Large Amounts of Data in Interactive Building Walkthroughs Proc. 1992 Symp. Interactive 3D Graphics, vol. 25, no. 2, pp. 1120, Mar. 1992.
[39] B. Garlick, D. Baum, and J. Winget, Parallel Algorithms and Architectures for 3D Image Generation, volume SIGGRAPH '90 Course Notes, vol 28, chapter Interactive Viewing of Large Geometric Data Bases Using Multiprocessor Graphics Workstations pp. 239245, 1990.
[40] C.M. Goral, K.E. Torrance, D.P. Greenberg, and B. Battaile, Modelling the Interaction of Light between Diffuse Surfaces Computer Graphics (SIGGRAPH '84 Proc.), vol. 18, no. 3, pp. 212222, July 1984.
[41] C. Gotsman, O. Sudarsky, and J. Fayman, Optimized Occlusion Culling Computer&Graphics, vol. 23, no. 5, pp. 645654, 1999.
[42] N. Greene, Occlusion Culling with Optimized Hierachical zBuffering ACM SIGGRAPH Visual Proc. 1999, 1999.
[43] N. Greene, Occlusion Culling with Optimized Hierachical zBuffering (CDRom Only) ACM SIGGRAPH Visual Proc. 1999, 1999.
[44] N. Greene, Occlusion Culling with Optimized Hierachical zBuffering ACM SIGGRAPH Course Notes #30, 2001.
[45] N. Greene, A Quality Knob for NonConservative Culling with Hierarchical zBuffering ACM SIGGRAPH Course Notes #30, 2001.
[46] N. Greene, M. Kass, and G. Miller, Hierarchical zBuffer Visibility Proc. SIGGRAPH '93, pp. 231240, 1993.
[47] N. Greene and M. Kass, ErrorBounded Antialiased Rendering of Complex Environments Proc. SIGGRAPH '94, Computer Graphics Proc., Ann. Conf. Series, pp. 5966, July 1994.
[48] P. Hanrahan, D. Salzman, and L. Aupperle, A Rapid Hierarchical Radiosity Algorithm ACM Computer Graphics, T.W. Sederberg, ed., vol. 25, pp. 197206, July 1991.
[49] L. Hong, S. Muraki, A. Kaufman, D. Bartz, and T. He, Virtual Voyage: Interactive Navigation in the Human Colon SIGGRAPH 97 Conf. Proc., Ann. Conf. Series, T. Whitted, ed., pp. 2734, Aug. 1997.
[50] T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff, and H. Zhang, Accelerated Occlusion Culling Using Shadow Frustra Proc. 13th Ann. ACM Symp. Computer Geometry, pp. 110, 1997.
[51] W.F.H. Jiménez, C. Esperança, and A.A.F. Oliveira, Efficient Algorithms for Computing Conservative Portal Visibility Information Computer Graphics Forum, vol. 19, no. 3, pp. 489498, Aug. 2000.
[52] C.B. Jones, A New Approach to the `Hidden Line' Problem Computer J., vol. 14, no. 3, pp. 232237, Aug. 1971.
[53] J.T. Klosowski, M. Held, J.S.B. Mitchell, H. Sowizral, and K. Zikan, Efficient Collision Detection Using Bounding Volume Hierarchies of kdops IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 1, pp. 2136, Jan.Mar. 1998.
[54] J.T. Klosowski and C.T. Silva, The PrioritizedLayered Projection Algorithm for Visible Set Estimation IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 2, pp. 108123, Apr.June 2000.
[55] J.T. Klosowski and C.T. Silva, Efficient Conservative Visibility Culling Using the PrioritizedLayered Projection Algorithm IEEE Trans. Visualization and Computer Graphics, vol. 7, no. 4, pp. 365379, Oct.Nov. 2001.
[56] J.T. Klosowski and C.T. Silva, Rendering on a Budget: A Framework for TimeCritical Rendering Proc. IEEE Visualization '99, pp. 115122, Oct. 1999.
[57] V. Koltun, Y. Chrysanthou, and D. CohenOr, Virtual Occluders: An Efficient Intermediate PVS Representation Rendering Techniques 2000: Proc. 11th Eurographics Workshop Rendering, pp. 5970, June 2000.
[58] V. Koltun, Y. Chrysanthou, and D. CohenOr, HardwareAccelerated FromRegion Visibility Using a Dual Ray Space Rendering Techniques 2001: Proc. 12th Eurographics Workshop Rendering, pp. 205216, June 2001.
[59] S. Kumar, D. Manocha, W. Garrett, and M. Lin, Hierarchical BackFace Computation Computers and Graphics, vol. 23, no. 5, pp. 681692, Oct. 1999.
[60] F.A. Law and T.S. Tan, Preprocessing Occlusion for RealTime Selective Refinement (Color Plate S. 221). Proc. 1999 Symp. Interactive 3D Graphics, pp. 4754, Apr. 1999.
[61] H.L. Lim, Toward a Fuzzy Hidden Surface Algorithm Proc. Computer Graphics Int'l, 1992.
[62] D. Luebke and C. Georges, Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets Proc. 1995 Symp. Interactive 3D Graphics, P. Hanrahan and J. Winget, eds., pp. 105106, Apr. 1995.
[63] D. Meagher, Efficient Synthetic Image Generation of Arbitrary 3D Objects Proc. IEEE CS Conf. Pattern Recognition and Image Processing, pp. 473478, 1982.
[64] T. Möller and E. Haines, RealTime Rendering. A.K. Peters Ltd., 1999.
[65] S. Morein, ATI Radeon HyperZ Technology Hot3D Proc. (talk), Graphics Hardware Workshop, 2000.
[66] B. Nadler, G. Fibich, S. LevYehudi, and D. CohenOr, A Qualitative and Quantitative Visibility Analysis in Urban Scenes Computer&Graphics, vol. 23, no. 5, pp. 655666, 1999.
[67] B.F. Naylor, Partitioning Tree Image Representation and Generation from 3D Geometric Models Proc. Graphics Interface '92, pp. 201212, 1992.
[68] J. O'Rourke, Art Gallery Theorems and Algorithms. New York: Oxford Univ. Press, 1987.
[69] R. Orti, S. Riviére, F. Durand, and C. Puech, Radiosity for Dynamic Scenes in Flatland with the Visibility Complex Computer Graphics Forum, vol. 15, no. 3, pp. 237248, Aug. 1996.
[70] S. Parker, W. Martin, P.P.J. Sloan, P.S. Shirley, B. Smits, and C. Hansen, Interactive Ray Tracing Proc. 1999 ACM Symp. Interactive 3D Graphics, pp. 119126, Apr. 1999.
[71] H. Plantinga, Conservative Visibility Preprocessing for Efficient Walkthroughs of 3D Scenes Proc. Graphics Interface '93, pp. 166173, May 1993.
[72] J. Rohlf and J. Helman, IRIS Performer: A High Performance Multiprocessing Toolkit for RealTime 3D Graphics Proc. SIGGRAPH '94, Computer Graphics Proc., Ann. Conf. Series, A. Glassner, ed., pp. 381395, July 1994.
[73] C. SaonaVazquez, I. Navazo, and P. Brunet, The Visibility Octree: A Data Structure for 3D Navigation Computer&Graphics, vol. 23, no. 5, pp. 635644, 1999.
[74] G. Schaufler, J. Dorsey, X. Decoret, and F.X. Sillion, Conservative Volumetric Visibility with Occluder Fusion Proc. SIGGRAPH 2000, pp. 229238, July 2000.
[75] N. Scott, D. Olsen, and E. Gannet, An Overview of the Visualize fx Graphics Accelerator Hardware The HewlettPackard J., May 1998.
[76] K. Severson, VISUALIZE Workstation Graphics for Windows NT HP product literature, 1999.
[77] Silicon Graphics, Inc., SGI Visual Workstation OpenGL Programming Guide for Windows NT Technical Report Document Number 0073876001, 1999.
[78] F.X. Sillion, A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters IEEE Trans. Visualization and Computer Graphics, vol. 1, no. 3, pp. 240254, Sept. 1995.
[79] F.X. Sillion and G. Drettakis, FeatureBased Control of Visibility Error: A MultiResolution Clustering Algorithm for Global Illumination Proc. SIGGRAPH '95, pp. 145152, Aug. 1995.
[80] M. Slater and Y. Chrysanthou, View Volume Culling Using a Probabilistic Cashing Scheme Proc. Framework for Immersive Virtual Environments FIVE, S. Wilbur and M. Bergamasco, eds., Dec. 1996.
[81] W. Stuerzlinger, Imaging All Visible Surfaces Proc. Graphics Interface '99, pp. 115122, June 1999.
[82] O. Sudarsky and C. Gotsman, Dynamic Scene Occlusion Culling IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 1, pp. 1329, Jan.Mar. 1999.
[83] I.E. Sutherland, R.F. Sproull, and R.A. Schumaker, A Characterization of Ten Hidden Surface Algorithms ACM Computer Surveys, vol. 6, no. 1, pp. 155, Mar. 1974.
[84] S. Teller, Visibility Computations in Densely Occluded Environments PhD thesis, Univ. of California, Berkeley, 1992.
[85] S. Teller and P. Hanrahan, Global Visibility Algorithms for Illumination Computations Proc. SIGGRAPH '93, pp. 239246, Aug. 1993.
[86] S.J. Teller, Computing the Antipenumbra of an Area Light Source Computer Graphics (Proc. SIGGRAPH '92), vol. 26, no. 2, pp. 139148, July 1992.
[87] S.J. Teller and C.H. Séquin, Visibility Preprocessing for Interactive Walkthroughs Computer Graphics (Proc. SIGGRAPH '91), vol. 25, no. 4, pp. 6169, July 1991.
[88] M. van de Panne and J. Stewart, Efficient Compression Techniques for Precomputed Visibility Proc. Eurographics Rendering Workshop 1999, June 1999.
[89] I. Wald and P. Slusallek, StateoftheArt in Interactive Ray Tracing 2001.
[90] I. Wald, P. Slusallek, and C. Benthin, Interactive Distributed Ray Tracing of Highly Complex Models Rendering Techniques 2001 Proc. 12th EUROGRAPHICS Workshop Rendering, pp. 274285, 2001.
[91] I. Wald, P. Slusallek, C. Benthin, and M. Wagner, Interactive Rendering with Coherent Raytracing Computer Graphics Forum, vol. 20, no. 3, pp. 153164, 2001.
[92] P. Wonka and D. Schmalstieg, Occluder Shadows for Fast Walkthroughs of Urban Environments Computer Graphics Forum, vol. 18, no. 3, pp. 5160, Sept. 1999.
[93] P. Wonka, M. Wimmer, and D. Schmalstieg, Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs Rendering Techniques 2000: 11th Eurographics Workshop on Rendering, pp. 7182, June 2000.
[94] P. Wonka, M. Wimmer, and D. Schmalstieg, Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs Technical Report TR18620006, Inst. of Computer Graphics, Vienna Univ. of Tech nology, Mar. 2000.
[95] P. Wonka, M. Wimmer, and F.X. Sillion, Instant Visibility Computer Graphics Forum, vol. 20, no. 3, pp. 411421, 2001.
[96] A. Woo, P. Poulin, and A. Fourier, A Survey of Shadow Algorithms IEEE Computer Graphics and Applications, vol. 10, no. 6, pp. 1331, 1990.
[97] H. Zhang, Effective Occlusion Culling for the Interactive Display of Arbitrary Models PhD thesis, Dept. of Computer Science, Univ. of North CarolinaChapel Hill, 1998.
[98] H. Zhang, D. Manocha, T. Hudson, and K.E. Hoff III, Visibility Culling Using Hierarchical Occlusion Maps SIGGRAPH '97 Conf. Proc., Ann. Conf. Series, T. Whitted, ed., pp. 7788, Aug. 1997.