The Priority Face Determination Tree for Hidden Surface Removal

Computer Graphics Forum

Volumn 17, Issue 1, 1998, Pages 55-71

  James, A ^a   Day, A M ^a  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. H. Fuchs, Z. M. Kedem, and B. F. Naylor. On visible surface generation by a priori tree structures. ACM Computer Graphics, 14(3). pp. 124-133 (1980).
2. H. Fuchs, G. D. Abram, and E. D. Grant. Near real time shaded display of rigid objects. ACM Computer Graphics, 17(3). pp. 65-72 (1983).
3. P. Morer, A. M. Garcia-Alonso, and J. Flaquer. Optimization of a priority list algorithms for 3D rendering of buildings. Computer Graphics Forum, 14(4). pp. 217-227 (1995).
4. M. deBerg, M. M. deGroot, and M. H. Overmars. Perfect binary space partitions. Computational Geometry, 7. pp. 81-91 (1997).
5. H. Fuchs, Z. M. Kedem, and B. F. Naylor. Predetermining visibility priority in 3D scenes. ACM Computer Graphics Proceedings, 13(2). pp. 175-181 (1979).
6. I. E. Sutherland, R. F. Sproull, and R. A. Schumaker. A characterization of ten hidden-surface algorithms. ACM Computing Surveys, 6(1). pp. 1-55 (1974).
7. R. A. Schumaker, R. Brand, M. Gilliland, and W. Sharp. Study for applying computer-generated images to visual simulation. Technical Report AFHRL-TR-69-14, U. S. Airforce Human Resources Laboratory (1969).
8. M. S. Paterson and F. F. Yao. Efficient binary space partitioning for hidden surface removal and solid modelling. XEROX Corporation, PARC, pp. 1-16 (June 1989).
9. E. Torres. Optimization of the BSP algorithm for the visualization of dynamic scenes. Eurographics, pp. 507-518 (September 1990).
10. http://www.qualia.com/bspfaq. BSP FAQ. www.
11. S. J. Teller and C. H. Sequin. Visibility preprocessing for interactive walkthroughs. ACM Computer Graphics, 25(4). pp. 61-69 (1991).