Navigation in Highly Polygon-Populated Ship Environments using the Visibility Octree

  • Carlos Saona-Vázquez
  • Isabel Navazo
  • Pere Brunet


This work is focused on the interactive navigation through highly polygon-populated ship environments. A conservative visibility algorithm is presented that hierarchically computes visibility for different observer positions and stores it in a new octree based structure, the Visibility Octree (VO) The VO is used during the navigation. Its main contribution is the ability to provide an effective control over the coarseness of the visibility approximation. Some results are presented for indoor ship scenes that show that the VO is efficient on densely occluded scenes.


Voxel Space Occlude Zone Visible Polygon Annual Conference Series Interactive Navigation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CFHZ98]
    Daniel Cohen-Or, Gadi Fibich, Dan Halperin, and Eyal Zadicario. Conservative visibility and strong occlusion for views-pace partitioning of densely occluded scenes. Computer Graphics Forum, 17 (3): 243–253, 1998.CrossRefGoogle Scholar
  2. [CT96]
    Satyan Coorg and Seth Teller. Temporally coherent conservative visibility. In Proceedings of the Twelfth Annual Symposium On Computational Geometry,pages 78–87, New York, May 1996. ACM Press.Google Scholar
  3. [CT97]
    Satyan Coorg and Seth Teller. Real-time occlusion culling for models with large occluders. In Proceedings of the Symposium on Interactive 3D Graphics, pages 83–90. ACM Press, April 1997.Google Scholar
  4. [DDP96]
    Frédo Durand, George Drettakis, and Claude Puech. The 3D visibility complex: a new approach to the problems of accurate visibility. In Xavier Pueyo and Peter Schröder, editors, Eurographics Rendering Workshop 1996, pages 245–256. Eurographics, June 1996.Google Scholar
  5. [DDP97]
    Frédo Durand, George Drettakis, and Claude Puech. The visibility skeleton: A powerful and efficient multi-purpose global visibility tool. In Turner Whitted, editor, SIGGRAPH 97 Conference Proceedings, Annual Conference Series, pages 89–100. ACM SIGGRAPH, Addison Wesley, August 1997.Google Scholar
  6. [FKN80]
    H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. In SIGGRAPH ‘80 Conference Proceedings, pages 124–133, 1980.CrossRefGoogle Scholar
  7. [GCS91]
    Ziv Gigus, John Canny, and Raimund Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(6):542–551,1991.Google Scholar
  8. [GKM93]
    Ned Greene, Michael Kass, and Gavin Miller. Hierarchical Z-buffer visibility. In Computer Graphics Proceedings, Annual Conference Series, 1993, pages 231–240, 1993.Google Scholar
  9. [GS87]
    J. Goldsmith and J. Salmon. Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Applications, 7 (5): 14–20, May 1987.CrossRefGoogle Scholar
  10. [HMC+97]
    T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff, and H. Zhang. Accelerated occlusion culling using shadow frusta. In Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pages 1–10, June 1997.CrossRefGoogle Scholar
  11. PD90] H. Plantinga and C. Dyer. Visibility, occlusion, and the aspect graph. International Journal of Computer Vision,5(2):137160, 1990.Google Scholar
  12. [SNB99]
    Carlos Saona-Vazquez, Isabel Navazo, and Pere Brunet. The visibility octree. A data structure for 3D navigation. Computers & Graphics(1999), accepted for publication, 1999.Google Scholar
  13. [Te192]
    Seth Teller. Visibility Computation in Densely Occluded Polyhedral Environments. PhD thesis, CS Dept., UC Berkeley, 1992.Google Scholar
  14. [TH93]
    Seth Teller and Pat Hanrahan. Global visibility algorithms for illumination computations. In SIGGRAPH 93 Conference Proceedings, pages 239–246, 1993.CrossRefGoogle Scholar
  15. [T591]
    Seth J. Teller and Carlo H. Sequin. Visibility preprocessing for interative walkthroughs. Computer Graphics (SIG-GRAPH ‘81 Proceedings), 25 (4): 61–69, July 1991.CrossRefGoogle Scholar
  16. [ZMHH97]
    Hansong Zhang, Dinesh Manocha, Tom Hudson, and Kenneth E. Hoff III. Visibility culling using hierarchical occlusion maps. In SIGGRAPH 97 Conference Proceedings, pages 77–88. ACM SIGGRAPH, Addison Wesley, August 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Carlos Saona-Vázquez
  • Isabel Navazo
  • Pere Brunet
    • 1
  1. 1.Universitat Politècnica de CatalunyaSpain

Personalised recommendations