Accelerating virtual walkthrough with visual culling techniques

Virtual walkthrough application allows users to navigate and immerse in the generated 3D environment with computer graphics assist. The 3D environment requires a large amount of geometry to make it look realistic. When the number of geometry increase, the performance of the application will become slower. Consequently, it creates a conflict between the needs of realistic and real time. In this paper, we discuss the implementation of visual culling techniques such as view frustum culling, back face culling and occlusion culling in the virtual walkthrough application. We render only what we can see during the application runtime and cull away unnecessary geometry. This will accelerate the performance of the system. Without the culling techniques implemented in virtual reality application such as virtual walkthrough, the system has to allocate a large space of memory to store the geometry data. We have tested these techniques to the Ancient Malacca data. With the visual culling techniques implemented, the virtual walkthrough system can work in real time mode without scarifying realism factor.

[1]  Peter Shirley,et al.  Rendering, Complexity, and Perception , 1995 .

[2]  Michael Wimmer,et al.  Instant Visibility , 2001, Comput. Graph. Forum.

[3]  Carlo H. Séquin,et al.  Database and display algorithms for interactive visualization of architectural models , 1993 .

[4]  Complex scene generation , 1988 .

[5]  Ryugo Kijima,et al.  Constructing the Historic Villages of Shirakawa-go in Virtual Reality , 2000, IEEE Multim..

[6]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[7]  Hansong Zhang,et al.  Fast backface culling using normal masks , 1997, SI3D.

[8]  Donald P. Greenberg,et al.  A perceptually based physical error metric for realistic image synthesis , 1999, SIGGRAPH.

[9]  Dinesh Manocha,et al.  Accelerated occlusion culling using shadow frusta , 1997, SCG '97.

[10]  FouquierEPITA Resear.  Visualization Issues In Virtual Environments: From Computer Graphics Techniques To Intentional Visualization , 2001 .

[11]  John M. Airey,et al.  Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations , 1990 .

[12]  Joëlle Thollot,et al.  Conservative visibility preprocessing using extended projections , 2000, SIGGRAPH.

[13]  Yiannis E. Papelis,et al.  Driving simulation: challenges for VR technology , 1996, IEEE Computer Graphics and Applications.

[14]  Hansong Zhang,et al.  Effective occlusion culling for the interactive display of arbitrary models , 1998 .

[15]  Dirk Bartz,et al.  OpenGL-assisted occlusion culling for large polygonal models , 1999, Comput. Graph..

[16]  Fan Wu,et al.  A Developer's Survey of Polygonal Simplification algorithms , 2005 .

[17]  Cláudio T. Silva,et al.  The Prioritized-Layered Projection Algorithm for Visible Set Estimation , 2000, IEEE Trans. Vis. Comput. Graph..

[18]  Robert F. Berry,et al.  Bringing VR to the Desktop: Are You Game? , 2000, IEEE Multim..

[19]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[20]  Timo Aila,et al.  Efficient algorithms for occlusion culling and shadows , 2005 .

[21]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[22]  Michael Wimmer,et al.  Representing and Rendering Distant Objects for Real-Time Visualization , 2001 .

[23]  Ned Greene.  Efficient occlusion culling for z-buffer systems , 1999, 1999 Proceedings Computer Graphics International.

[24]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[25]  Peter Wonka,et al.  Occlusion Culling for Real-Time Rendering of Urban Environments , 2001 .

[26]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

[27]  François X. Sillion,et al.  Conservative volumetric visibility with occluder fusion , 2000, SIGGRAPH.

[28]  Tomas Akenine-Möller,et al.  Optimized View Frustum Culling Algorithms for Bounding Boxes , 2000, J. Graphics, GPU, & Game Tools.

[29]  Dinesh Manocha,et al.  Efficient visibility-based algorithms for interactive walkthrough, shadow generation, and collision detection , 2004 .

[30]  Michael Wimmer,et al.  Instant architecture , 2003, ACM Trans. Graph..

[31]  José Ripper Kós,et al.  The City that Doesn't Exist: Multimedia Reconstruction of Latin American Cities , 2000, IEEE Multim..

[32]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[33]  Michael Wimmer,et al.  Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs , 2000, Rendering Techniques.