Optimized occlusion culling using five-dimensional subdivision

Computers and Graphics (Pergamon)

Volumn 23, Issue 5, 1999, Pages 645-654

  Gotsman, Craig ^a   Sudarsky, Oded ^a   Fayman, Jeffrey A ^a  

^a Virtue Ltd   (Israel)

Author keywords

5D spatial subdivision; K D trees; Occlusion culling

Indexed keywords

EID: 0348227760     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(99)00088-6     Document Type: Article

References (27)

1. Coorg S, Teller SJ. Real-time occlusion culling for models with large occluders. In Proceedings of Symposium on Interactive 3D Graphics, ACM SIGGRAPH, 1997. p. 83-90. http://graphics.1cs.mit.edu/∼seth/pubs/realtime-i3d97.ps.gz
2. Greene N, Kass M, Miller G. Hierarchical Z-buffer visibility. ACM Computer Graphics Ann. Conference Series (Proceedings of SIGGRAPH) 1993. p. 231-38.
3. Hudson T, Manocha D, Choen J, Lin MC, Hoff III KE, Zhang H. Accelerated occlusion culling using shadow frusta. Proceedings of 13th Ann. Symposium on Computational Geometry. ACM SIGGRAPH and SIGACT, 1997 p. 1-10. ftp://ftp.cs.unc.edu/pub/users/manocha/PAPERS/ VISIBILITY/shadow.{ps.gz, pdf}
4. Naylor BF. Partitioning tree image representation and generation from 3D geometric models. Proceedings of Graphics Interface 1992. p. 201-12.
5. Teller SJ, Séquin CH. Visibility preprocessing for interactive walkthroughs. ACM Computer Graphics (Proceedings of SIGGRAPH) 1991;25:61-9.
6. Zhang H, Manocha D, Hudson T, Hoff III KE. Visibility culling using hierarchical occlusion maps. ACM Computer Graphics Ann. Conference Series (Proceedings of SIGGRAPH), 1997. p. 77-88. ftp:// ftp.cs.unc.edu/pub/users/manocha/PAPERS/VISIBILITY/ hom.{ps.gz, pdf}
7. Schroeder WJ, Zarge JA, Lorenson WE. Decimation of triangle meshes. ACM Computer Graphics (Proceedings of SIGGRAPH) 1992;26:65-70.
8. Shade J, Lischinski D, Salesin DH, DeRose T, Snyder J. Hierarchical image caching for accelerated walkthroughs of complex environments. ACM Computer Graphics Ann. Conference Series (Proceedings of SIGGRAPH), 1996. p. 75-82. http://www.cs.huji.ac.il/∼danix/papers/ s96-wa.ps.gz
9. Jones CB. A new approach to the 'hidden line' problem. The Computer Journal 1971;14:232-7.
10. Arvo J, Kirk D. Fast ray tracing by ray classification. ACM Computer Graphics (Proceedings of SIGGRAPH). 1987;21:55-64.
11. Airey JM, Rohlf JH, Brooks Jr. FP. Towards image realism with interactive update rates in complex virtual building environments. ACM Computer Graphics (Proceedings of Symposium on Interactive 3D Graphics). 1990;24:41-9.
12. Funkhouser TA. Database management for interactive display of large architectural models. In Proceedings of Graphics Interface, 1996. p. 1-8. http://www.bell-labs.com/user/funk/gi96.ps.gz
13. Funkhouser TA, Séquin CH, Teller SJ. Management of large amounts of data in interactive building walk throughs. In Proceedings of Symposium on Interactive 3D Graphics. ACM SIGGRAPH, 1992. p. 11-20. http://www. bell-labs.com/user/funk/symp92.ps.gz, http://graphics.lcs. mit.edu/∼seth/pubs/FunkST-i3d92.ps.gz
14. Luebke DP, Georges C. Portals and mirrors: simple, fast evaluation of potentially visible sets. Proceedings of Symposium on Interactive 3D Graphics, ACM SIGGRAPH, 1995, p. 105-6. http://www.cs.virginia.edu/∼luebke/publications/portals.html
15. Greene N, Kass M. Error-bounded antialiased rendering of complex environments. ACM Computer Graphics Ann. Conference Series (Proceedings of SIGGRAPH) 1994. p. 59-66.
16. Greene N. Hierarchical polygon tiling with coverage masks. ACM Computer Graphics Ann. Conference Series (Proceedings of SIGGRAPH), 1996. p. 65-74. http://wwwx.cs.unc.edu/∼hoff/projects/comp390/papers/ greene.pdf
17. Meagher DJ. Efficient synthetic image generation of arbitrary 3-D objects. In Proceedings of Conference on Pattern Recognition and Image Processing. IEEE Computer Society, 1982. p. 473-8.
18. Naylor BF. Constructing good partitioning trees. Proceedings of Graphics Interface, 1993. p. 181-91.
19. Plantinga H. Conservative visibility preprocessing for efficient walkthroughs of 3D scenes. Proceedings of Graphics Interface, 1993. p. 166-73.
20. Simiakakis G, Day AM. Five-dimensional adaptive subdivision for ray tracing. Computer Graphics Forum 1994;13:133-40.
21. Kwon B, Kim DS, Chwa K-Y, Shin S-Y. Memory-efficient ray classification for visibility operations. IEEE Transactions on Visualization and Computer Graphics 1998; 4:193-201.
22. Cohen-Or D, Fibich G, Halperin D, Zadicario E. Conservative visibility and strong occlusion for view-space partitioning of densely occluded scenes. Computer Graphics Forum 1998;17:243-53. (Proceedings of Eurographics). ftp://ftp.math.tau.ac.il/pub/daniel/vis_eg.ps.gz
23. Wang Y, Bao H, Peng Q. Accelerated walkthroughs of virtual environments based on visibility processing and simplification. Computer Graphics Forum 1998;17:C-187-C-94 (Proceedings of Eurographics).
24. Samet H. Applications of spatial data structures: computer graphics, image processing, and GIS. Reading, MA: Addison-Wesley, 1990.
25. Wetherill GB. Sequential methods in statistics. London: Methuen & Co. Ltd, New York: Wiley, 1966.
26. Chrysanthou Y, Cohen-Or D, Lischinski D. Fast approximate quantitative visibility for complex scenes. In Proceedings of Computer Graphics International. 1988. p. 220-7. http://www.math.tau.ac.il/∼daniel/cgi98/cgi98.html
27. Clark JH. Hierarchical geometric models for visible surface algorithms. Communications of the ACM 1976; 19:547-54.