메뉴 건너뛰기




Volumn 1998-January, Issue , 1998, Pages 207-219

Hierarchical visibility culling with occlusion trees

Author keywords

BSP; Occlusion culling; Real time rendering; Spatial partitioning; Virtual reality; Visibility

Indexed keywords

FORESTRY; RENDERING (COMPUTER GRAPHICS); TOPOLOGY; VIRTUAL REALITY; VISIBILITY;

EID: 85022109307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGI.1998.694268     Document Type: Conference Paper
Times cited : (65)

References (20)
  • 1
    • 0030402587 scopus 로고    scopus 로고
    • The feudal priority algorithm on hidden-surface removal
    • Aug.
    • H. Chen and W. Wang. The feudal priority algorithm on hidden-surface removal. In Proceedings of SIGGRAPH'96, pages 55-64, Aug. 1996.
    • (1996) Proceedings of SIGGRAPH'96 , pp. 55-64
    • Chen, H.1    Wang, W.2
  • 2
    • 85034219450 scopus 로고
    • Near real-time shadow generation using BSP trees
    • Aug.
    • N. Chin and S. Feiner. Near real-time shadow generation using BSP trees. In Proceedings of SIGGRAPH'90, pages 99-106, Aug. 1990.
    • (1990) Proceedings of SIGGRAPH'90 , pp. 99-106
    • Chin, N.1    Feiner, S.2
  • 4
    • 0000722742 scopus 로고    scopus 로고
    • The 3D Visibility Complex, a new approach to the problems of accurate visibility
    • June
    • F. Durand, G. Drettakis, and C. Puech. The 3D Visibility Complex, a new approach to the problems of accurate visibility. In Eurographics Workshop on Rendering, June 1996.
    • (1996) Eurographics Workshop on Rendering
    • Durand, F.1    Drettakis, G.2    Puech, C.3
  • 5
    • 0019033556 scopus 로고
    • On visible surface generation by a priori tree structures
    • July
    • H. Fuchs, Z. M. Kedem, and B. F. Naylor. On visible surface generation by a priori tree structures. In Proceedings of SIGGRAPH'80, pages 124-133, July 1980.
    • (1980) Proceedings of SIGGRAPH'80 , pp. 124-133
    • Fuchs, H.1    Kedem, Z.M.2    Naylor, B.F.3
  • 6
    • 0005630989 scopus 로고
    • Detecting intersection of a rectangular solid and a convex polyhedron
    • Academic Press, Boston
    • N. Greene. Detecting intersection of a rectangular solid and a convex polyhedron. In Graphics Gems IV, pages 74-82. Academic Press, Boston, 1994.
    • (1994) Graphics Gems , vol.4 , pp. 74-82
    • Greene, N.1
  • 7
    • 0030398670 scopus 로고    scopus 로고
    • Hierarchical polygon tiling with coverage masks
    • Aug.
    • N. Greene. Hierarchical polygon tiling with coverage masks. In Proceedings of SIGGRAPH'96, pages 65-74, Aug. 1996.
    • (1996) Proceedings of SIGGRAPH'96 , pp. 65-74
    • Greene, N.1
  • 8
    • 84945372994 scopus 로고
    • Hierarchical Z-buffer visibility
    • ACM Press, Aug
    • N. Greene, M. Kass, and G. Miller. Hierarchical Z-buffer visibility. In Proceedings of SIGGRAPH'93, pages 231-238. ACM Press, Aug. 1993.
    • (1993) Proceedings of SIGGRAPH'93 , pp. 231-238
    • Greene, N.1    Kass, M.2    Miller, G.3
  • 11
    • 0029194987 scopus 로고
    • Portals and mirrors: Simple, fast evaluation of potentially visible sets
    • ACM SIGGRAPH, Apr
    • D. Luebke and C. Georges. Portals and mirrors: Simple, fast evaluation of potentially visible sets. In 1995 Symposium on Interactive 3D Graphics, pages 105-106. ACM SIGGRAPH, Apr. 1995.
    • (1995) 1995 Symposium on Interactive 3D Graphics , pp. 105-106
    • Luebke, D.1    Georges, C.2
  • 14
    • 84888978046 scopus 로고
    • IRIS performer: A high performance multiprocessing toolkit for real-Time 3D graphics
    • July
    • J. Rohlf and J. Helman. IRIS performer: A high performance multiprocessing toolkit for real-Time 3D graphics. In Proceedings of SIGGRAPH'94, pages 381-395, July 1994.
    • (1994) Proceedings of SIGGRAPH'94 , pp. 381-395
    • Rohlf, J.1    Helman, J.2
  • 15
    • 0027886632 scopus 로고
    • Global visibility algorithms for illumination computations
    • S. Teller and P. Hanrahan. Global visibility algorithms for illumination computations. In Proceedings of SIGGRAPH'93, pages 239-246, 1993.
    • (1993) Proceedings of SIGGRAPH'93 , pp. 239-246
    • Teller, S.1    Hanrahan, P.2
  • 16
    • 0003721828 scopus 로고
    • PhD thesis, Dept. of Computer Science, University of California, Berkeley, Technical Report UCB//CSD-92-708
    • S. J. Teller. Visibility Computations in Densely Occluded Polyhedral Environments. PhD thesis, Dept. of Computer Science, University of California, Berkeley, 1992. Also available as Technical Report UCB//CSD-92-708.
    • (1992) Visibility Computations in Densely Occluded Polyhedral Environments
    • Teller, S.J.1
  • 17
    • 84904535957 scopus 로고
    • Visibility preprocessing for interactive walkthroughs
    • July
    • S. J. Teller and C. H. Séquin. Visibility preprocessing for interactive walkthroughs. In Proceedings of SIGGRAPH'91, pages 61-69, July 1991.
    • (1991) Proceedings of SIGGRAPH'91 , pp. 61-69
    • Teller, S.J.1    Séquin, C.H.2
  • 18
    • 0023380251 scopus 로고
    • Set operations on polyhedra using binary space partitioning trees
    • July
    • W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. In Proceedings of SIGGRAPH'87, volume 21, pages 153-162, July 1987.
    • (1987) Proceedings of SIGGRAPH'87 , vol.21 , pp. 153-162
    • Thibault, W.C.1    Naylor, B.F.2
  • 19
    • 0039608086 scopus 로고
    • Visibility computation for efficient walkthrough of complex environments
    • R. Yagel and W. Ray. Visibility computation for efficient walkthrough of complex environments. Presence: Teleoperators and Virtual Environments, 5(1), 1995.
    • (1995) Presence: Teleoperators and Virtual Environments , vol.5 , Issue.1
    • Yagel, R.1    Ray, W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.