Efficient algorithms for computing conservative portal visibility information

Computer Graphics Forum

Volumn 19, Issue 3, 2000, Pages 489-498

  Jimenez W F H ^a   Esperanca C ^a   Oliveira, A A F ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DATA STRUCTURES; GRAPH THEORY;

CONSERVATIVE PORTAL VISIBILITY INFORMATION; PORTAL VISIBILITY SKELETON;

COMPUTER GRAPHICS;

EID: 0043222962     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00441     Document Type: Article

References (12)

1. A.J. Steward and S. Ghali. Fast computation of shadow boundaries using spatial coherence and backprojections. Computer Graphics : 231-238. Orlando. SIGGRAPH'94 Proc. July 1994.
2. C.B. Jones. A New Approach to the 'Hidden Line' Problem. The Computer Journal 14(3): 232. August 1971.
3. F. Durand, G. Drettakis, and C. Puech. The Visibility Skeleton: A Powerful and Efficient Multi-Purpose Global Visibility Tool. Turner Whitted. Computer Graphics : 89-100. Los Angeles, Addison Wesley. Annual Conference Series. SIGGRAPH'97 Proc. August 1997.
4. G. Drettakis and E. Fiume. A Fast Shadow Algorithm for Area Light Sources Using Backprojection. Computer Graphics : 223-230. Orlando. SIGGRAPH'94 Proc. July 1994.
5. H. Plantinga and C.R. Dyer. Visibility, Occlusion, and the Aspect Graph. International Journal of Computer Vision 5(2): 137-160. 1990.
6. J. Airey. Increasing Update Rates in the Building Walk-through System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations. TR #90-027. UNC-CH CS Departament. Ph.D Thesis. July 1990.
7. J. O'Rourke. Computational Geometry in C. Cambridge University Press. 1994.
8. M. Pellegrini. Stabbing and Ray Shooting in 3-Dimensional Space. Proceedings of the Sixth Annual Symposium on Computational Geometry : 177-186. June 1990.
9. S.J. Teller. Computing the antipenumbra of an area light source. Computer Graphics 26(4): 139-148. Chicago. SIGGRAPH'92 Proc. July 1992a.
10. S.J. Teller. Visibility Computation in Densely Occluded Polyhedral Environments. TR #92/708. UC Berkeley CS Department. Ph.D Thesis. 1992b.
11. Z. Gigus, J. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans. on Pat. Matching & Mach. Intelligence 13(6). June 1991.
12. Z. Gigus and J. Malik. Computing the aspect graph for the line drawings of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(2): 113-122. February 1990.