Exact regional visibility using line space partitioning

Computers and Graphics (Pergamon)

Volumn 27, Issue 4, 2003, Pages 569-580

  Bittner, Jiří ^a,b   Přikryl, Jan ^a,b   Slavík, Pavel ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Geometric algorithms; Spatial hierarchies; Visible surface algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; TREES (MATHEMATICS); VISIBILITY;

COMPUTING VISIBILITY;

COMPUTER GRAPHICS;

EID: 0042092187     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(03)00101-8     Document Type: Article

References (34)

1. Wonka P, Wimmer M, Schmalstieg D. Visibility preprocessing with occluder fusion for urban walkthroughs. In: Rendering techniques (Proceedings of Eurographics Workshop on Rendering '00). Wien, Springer-Verlag, 2000. p. 71-82.
2. Koltun V, Chrysanthou Y, Cohen-Or D. Hardware-accelerated from-region visibility using a dual ray space. In: Rendering techniques (Proceedings of Eurographics Workshop on Rendering '01). Wien, Springer-Verlag, 2001. p. 205-16.
3. Teller SJ, Séquin CH. Visibility preprocessing for interactive walkthroughs. In: Computer graphics (SIGGRAPH '91 Proceedings). NY, ACM Press, 1991. p. 61-9.
4. Bittner J, Wonka P, Wimmer M. Visibility preprocessing for urban scenes using line space subdivision. In: Proceedings of Pacific Graphics (PG '01), IEEE Computer Society. Tokyo, Japan, 2001. p. 276-84.
5. Koltun V, Chrysanthou Y, Cohen-Or D. Virtual occluders: an efficient intermediate pvs representation. In: Rendering techniques (Proceedings of Eurographics Workshop on Rendering '00). Wien, Springer-Verlag, 2000. p. 59-70.
6. Schaufler G, Dorsey J, Decoret X, Sillion FX. Conservative volumetric visibility with occluder fusion. In: Computer Graphics (SIGGRAPH '00 Proceedings). NY, ACM Press, 2000. p. 229-38.
7. Sudarsky O., Gotsman C. Output-sensitive visibility algorithms for dynamic scenes with applications to virtual reality. Computer Graphics Forum. 15(3):1996;C249-C258.
8. Durand F. 3D visibility: analytical study and applications. Ph.D thesis, Universite Joseph Fourier, Grenoble, France, July 1999.
9. Bittner J, Wonka P. Visibility in computer graphics. Journal of Environmental Planning, 2003, to appear.
10. Cohen-Or D, Chrysanthou Y, Silva C, Durand F. A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics, to appear.
11. Plantinga H., Dyer C. Visibility, occlusion, and the aspect graph. International Journal of Computer Vision. 5(2):1990;137-160.
12. Teller S.J. Computing the antipenumbra of an area light source. Computer Graphics (SIGGRAPH '92 Proceedings). 26(2):1992;139-148.
13. Drettakis G, Fiume E. A fast shadow algorithm for area light sources using backprojection. in: Computer graphics (SIGGRAPH '94 Proceedings). NY, ACM Press, 1994. p. 223-30.
14. Stewart AJ, Ghali S. Fast computation of shadow boundaries using spatial coherence and backprojections. In: Computer graphics, (SIGGRAPH '94 Proceedings). NY, ACM Press, 1994. p. 231-8.
15. Durand F, Drettakis G, Puech C. The visibility skeleton: a powerful and efficient multi-purpose global visibility tool. In: Computer graphics (SIGGRAPH '97 Proceedings). NY, ACM Press, 1997. p. 89-100.
16. Greene N, Kass M, Miller G. Hierarchical Z-buffer visibility. In: Computer graphics (SIGGRAPH '93 Proceedings). NY, ACM Press, 1993. p. 231-8.
17. Zhang H, Manocha D, Hudson T, Hoff III KE. Visibility culling using hierarchical occlusion maps. In: Computer graphics (Proceedings of SIGGRAPH'97), Annual Conference Series. NY, ACM Press, 1997. p. 77-88.
18. Luebke D, Georges C. Portals and mirrors: simple, fast evaluation of potentially visible sets. In: Proceedings of Symposium on Interactive 3D Graphics '95. New York: ACM SIGGRAPH; 1995. p. 105-6.
19. Coorg S, Teller S. Real-time occlusion culling for models with large occluders. In: Proceedings of the Symposium on Interactive 3D Graphics. New York: ACM Press, 1997. p. 83-90.
20. Hudson T, Manocha D, Cohen J, Lin M, Hoff K, Zhang H. Accelerated occlusion culling using shadow frusta. In: Proceedings of ACM Symposium on Computational Geometry. NY, ACM Press, 1997. p. 1-10.
21. Bittner J, Havran V, Slavík P. Hierarchical visibility culling with occlusion trees. In: Proceedings of Computer Graphics International '98 (CGI'98). New York: IEEE Press, 1998, p. 207-19.
22. Airey JM, Rohlf JH, Brooks Jr FP. Towards image realism with interactive update rates in complex virtual building environments. In: Proceedings of Symposium on Interactive 3D Graphics. New York: ACM SIGGRAPH, 1990. p. 41-50.
23. Cohen-Or D, Fibich G, Halperin D, Zadicario E. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. In: Computer graphics forum (Eurographics '98 Proceedings). UK, Blackwell Publishers, 1998. p. 243-53.
24. Durand F, Drettakis G, Thollot J, Puech C. Conservative visibility preprocessing using extended projections. In: Computer Graphics (SIGGRAPH '00 Proceedings). NY, ACM Press, 2000. p. 239-48.
25. 2) time Information Processing Letters. 20(4):1985;167-171.
26. Vegter G. The visibility diagram: a data structure for visibility problems and motion planning. In: In Proceedings of the Second Scandinavian Workshop on Algorithm Theory (SWAT '90), vol. 447 of Lecture Notes in Computer Science. Berlin: Springer, 1990. p. 97-110.
27. Pocchiola M, Vegter G. The visibility complex. In: Proceedings of ACM Symposium on Computational Geometry. NY, ACM Press, 1993. p. 328-37.
28. Rivière S. Dynamic visibility in polygonal scenes with the visibility complex. In: Proceedings of ACM Symposium on Computational Geometry '97. New York: ACM Press, 1997. p. 421-3.
29. Hinkenjann A, Müller H. Hierarchical blocker trees for global visibility calculation. Research Report 621/1996, University of Dortmund, August 1996.
30. Stolfi J. Oriented projective geometry: a framework for geometric computations. 1991;Academic Press, New York.
31. Chin N, Feiner S. Near real-time shadow generation using BSP trees. In: Computer Graphics (Proceedings of SIGGRAPH '89). NY, ACM Press, 1989. p. 99-106.
32. Naylor B., Amanatides J., Thibault W. Merging BSP trees yields polyhedral set operations. Computer Graphics (SIGGRAPH '90 Proceedings). 24(4):1990;115-124.
33. Abacus Ltd., VR Glasgow project, 2003, http://www.vrglasgow.co.uk/.
34. Orti R, Riviere S, Durand F, Puech C. Using the visibility complex for radiosity computation. In: Lecture Notes in Computer Science (Applied Computational Geometry: Towards Geometric Engineering), vol. 1148. Berlin, Germany: Springer, 1996. p. 177-90.