Occlusion culling using minimum occluder set and opacity map

Proceedings of the International Conference on Information Visualisation

Volumn 1999-January, Issue , 1999, Pages 292-300

  Ho, Poon Chun ^a   Wang, Wenping ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION ANALYSIS; INFORMATION SCIENCE; INFORMATION SYSTEMS; OPACITY; PROGRAM PROCESSORS; TESTING; VIRTUAL REALITY; VISUALIZATION;

DEPTH MAP; INTEGER OPERATIONS; OCCLUSION CULLING; OPACITY MAPS; OPTIMAL SETS; PRE-PROCESSING; TEST MODELING; WALKTHROUGHS;

ALGORITHMS;

EID: 84946035077     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.1999.781573     Document Type: Conference Paper

References (18)

1. P. K. Agarwal, L. J. Guibas, T. M. Murali and J. S. Vitter. Cylindrical Static and Kinetic Binary Space Partitions. Computational Geometry 97, pp. 39-48.
2. K. Akeley. RealityEngine Graphics. SIGGRAPH 93, pp. 109-116.
3. E. Catmull, A Subdivision Algorithm for Computer Display of Curved Surfaces. PhD thesis, University of Utah, 1974.
4. S. Coorg and S. Teller. Temporally Coherent Conservative Visibility. Symposium on Computational Geometry 1996, pp. 78-87.
5. S. Coorg and S. Teller. Real-Time Occlusion Culling for Models with Large Occluders. Symposium on Interactive 3D Graphics 1997, pp. 83-90.
6. H. Fuchs, Z. M. Kedem, and B. F. Naylor. On Visible Surface Generation by A Priori Tree Structures. SIGGRAPH 80, pp. 124-133.
7. N. Greene, M. Kass and G. Miller. Hierarchical Z-Buffer Visibility. SIGGRAPH 93, pp. 231-238.
8. N. Greene. Hierarchical Polygon Tiling with Coverage Masks. SIGGRAPH 96, pp. 65-74.
9. T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff and H. Zhang. Accelerated Occlusion Culling using Shadow Frusta. Computational Geometry 97, pp. 1-10.
10. D. Luebke and C. Georges. Portals and Mirrors: Simple, Fast Evaluation of Potential Visible Sets. Symposium on Interactive 3D Graphics, 199, pp. 105-106.
11. K. Mulmuley. An Efficient Algorithm for Hidden Surface Removal. SIGGRAPH 89, pp. 379-388.
12. B. Naylor. Partitioning Tree image Representation and Generation from 3D Geometric Models. Graphics Interface 92, pp. 201-211.
13. R. Schumacker, B. Brand, M. Gilliland, and W. Sharp. Study for Applying Computer-Generated Images to Visual Simulation. Technical Report AFHRL-TR-69-14. 1969.
14. J. Snyder and J. Lengyel. Visibility Sorting and Compositing without Splitting for Image Layer Decomposition. SIGGRAPH 98, pp. 219-230.
15. S. Teller and C.H. Sequin. Visibility Pre-processing for Interactive Walkthroughs. SIGGRAPH 91, pp. 61-69.
16. E. Torres. Optimization of the Binary Space Partition Algorithm for the Visualization of Dynamic Scenes. Eurographics 90, pp. 507-518.
17. H. Zhang, D. Manocha, T. Hudson and K. E. Hoff III. Visibility Culling using Hierarchical Occlusion Maps. SIGGRAPH 97, pp. 77-88.
18. F. Sillion, G. Drettakis, B. Bodelet. Efficient Impostor Manipulation for Real-Time visualization of Urban Scenery. Eurographics 97, pp. 207-218.