1W.F.H. Jimenez, C. Esperanca, A. F. O. Antonio. Efficient algorithms for computing conservative portal visibility information.Computer Graphics Forum, 2000, 19(3): 499～506.
2D. Luebke, C. Georges. Portals and mirrors: Simple, fast evaluation of potentially visible sets. Symposium on Interactive 3D Graphics'95. Monterey, California: ACM Press, 1995. 105～106.
3R. Yagel, W. Ray. Visibility computation for efficient walkthrough of complex environments. Presence, 1995, 5( 1 ) : 45～60.
4G.A. Daniel, A. L. Anselmo. Architectural walkthroughs using portal textures. The Conference on Visualization ' 97, Phoenix,Arizona, USA, 1997.
5D. Cohen-Or, G. Fibich, D. Halperin, et al. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. Computer Graphics Forum, 1998, 17 (3) : 243～ 253.
6J. Bittner, P. Wonka, M. Wimmer. Visibility preprocessing for urban scenes using line space subdivision. Pacific Graphics (PG'01), Tokyo, 2001.
7T. Hudson, D. Manocha. Accelerated occlusion culling using shadow frusta. The 13th Annual ACM Sympos, Nice, France,1997.
8G. Drettakis, E. Fiume. A fast shadow algorithm for area light sources using back projection. Computer Graphics, 1994, 28: 223～230.
9J. Bittner. Efficient construction of visibility maps using approximate occlusion sweep. The 18th Spring Conference on Computer graphics, Budmerice, Slovakia, 2002.
10J. Bittner, V. Havran, P. Slavik. Hierarchical visibility culling with occlusion trees. Computer-Graphics International ' 98,Hannover, Germany, 1998.
