skip to main content
article

Portholes and planes: faster dynamic evaluation of potentially visible sets

Published: 01 April 2005 Publication History

Abstract

We describe a simple and efficient dynamic occlusion- culling algorithm for computing potentially visible sets (PVS) in densely occluded virtual environments. Our method is an optimization of a widely used technique in which a 3D environment is divided into cells and portals. Our algorithm computes the PVS in approximately half the time of previous portal methods at the expense of producing a slightly relaxed PVS. In addition, our algorithm enables fast culling of objects within cells using inexpensive object-space methods by using a lookup table to compute the diminished object-space view frustum. The algorithm takes advantage of temporal coherence, is easy to implement, and is particularly well suited for applications that need to compute a PVS for use in non-rendering tasks such as AI.

References

[1]
Airey, J. 1990. Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations. Ph.D. thesis, UNC-CH CS Dept., Tech Rep. 90-027, July 1990.
[2]
Assarsson, U. and Moller, T. 2000. Optimized view frustum culling algorithms for bounding boxes. J. Graphics Tools 5, 1 (2000), 9-22.
[3]
Bishop, L., Eberly, D., Whitted, T., Finch, M., Shantz, M. 1998. Designing a PC game engine. IEEE Computer Graphics and Applications 18, 1 (1998), 46-53.
[4]
Cohen-Or, D., Chrysanthou, Y., Silva, C., and Durand, F. 2003. A survey of visibility for walkthrough applications. IEEE Computer Graphics and Applications 9, 3 (2003), 412.
[5]
Greene, N. 1994. Detecting intersection of a rectangular solid and a convex polyhedron. Graphics Gems IV, Heckbert, 74-82.
[6]
Jones, C. B. 1971. A new approach to the 'hidden line' problem. The Computer J. 4, 3 (Aug. 1971), 232-237.
[7]
Lengyel, E. 2002. Mathematics for 3D Game Programming & Computer Graphics. 2002.
[8]
Luebke, D. and Georges, C. 1995. Portals and mirrors: Simple, fast evaluation of potential visible sets. In Proceedings of the1995 Symposium on Interactive 3D Graphics, P. Hanrahan and J. Winget, eds. (ACM SIGGRAPH, April 1995). 105-106.
[9]
Moller, T and Haines, E. 2002. Real-Time Rendering. 2nd ed. 2002.
[10]
Ritter, R. 1990. An efficient bounding sphere. Graphics Gems, Glassner. 301-303.
[11]
Round, T. 2000. Object occlusion culling. Game Programming Gems, DeLoura, 421-431.
[12]
Teller, S. 1992. Visibility computation in densely occluded polyhedral environments. Ph.D. thesis, UC Berkeley CS Dept., TR 92/708.

Cited By

View all
  • (2023)Visibility-Based R-Tree Spatial Index for Consistent Visualization in Indoor and Outdoor ScenesISPRS International Journal of Geo-Information10.3390/ijgi1212049812:12(498)Online publication date: 12-Dec-2023
  • (2013)User experience study of concurrent virtual environments with 2D tab and 3D portal UIs2013 International Conference on Engineering, Technology and Innovation (ICE) & IEEE International Technology Management Conference10.1109/ITMC.2013.7352662(1-12)Online publication date: Jun-2013
  • (2011)Cell Segmentation-based Dynamical Loading for Efficient VE NavigationComputer-Aided Design and Applications10.3722/cadaps.2011.407-4208:3(407-420)Online publication date: Jan-2011

Index Terms

  1. Portholes and planes: faster dynamic evaluation of potentially visible sets

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Computers in Entertainment
      Computers in Entertainment   Volume 3, Issue 2
      Theoretical and Practical Computer Applications in Entertainment
      April 2005
      74 pages
      EISSN:1544-3574
      DOI:10.1145/1063723
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 April 2005
      Published in CIE Volume 3, Issue 2

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. occlusion culling
      2. portal rendering
      3. visibility

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 21 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)Visibility-Based R-Tree Spatial Index for Consistent Visualization in Indoor and Outdoor ScenesISPRS International Journal of Geo-Information10.3390/ijgi1212049812:12(498)Online publication date: 12-Dec-2023
      • (2013)User experience study of concurrent virtual environments with 2D tab and 3D portal UIs2013 International Conference on Engineering, Technology and Innovation (ICE) & IEEE International Technology Management Conference10.1109/ITMC.2013.7352662(1-12)Online publication date: Jun-2013
      • (2011)Cell Segmentation-based Dynamical Loading for Efficient VE NavigationComputer-Aided Design and Applications10.3722/cadaps.2011.407-4208:3(407-420)Online publication date: Jan-2011

      View Options

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format.

      HTML Format

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media