Abstract
Four visibility acceleration techniques for speeding up the form-factor computation are presented and compared in this paper. Three-dimensional axis-aligned bounding boxes (BB), illumination volumes (IVs), and 3D convex hulls (CHs) are some of the methods described. A new method that enhances IVs with 3D axis-aligned BBs (BBIVs) is also proposed. The results of these methods are compared with the uniform space subdivision (USSD) method, which is used as a basis of comparison of the effectiveness of these acceleration methods. In addition, the advantages and the disadvantages of each of the proposed techniques is discussed.
Similar content being viewed by others
References
Aho AV, Hopcroft JE, Ullman JD (1983) Data structures and algorithms, Addison-Wesley, Reading, Massachussetts
Amanatides J, Woo A (1987) A fast voxel traversal algorithm for ray tracing. In: Marechal G (ed) Eurographics '87, pp 3–10
Cleary JG, Wyvill G (1988) Analysis of an algorithm for fast ray tracing using uniform space subdivision. Visual Comput 4: 65–83
Cleary JG, Wyvill B, Birtwistle GM, Vatti R (1983) Multiprocessor ray tracing, Technical Report No. 83/128/17, Department of Computer Science, University of Calgary, Alberta, Canada
Cohen MF, Greenberg DP (1985) The HemiCube: a radiosity solution for complex environments. Comput Graph 19:31–40
Fujimoto A, Tanaka T, Iwata K (1986) ARTS: accelerated ray tracing system. IEEE Comput Graph Appl 6:16–26
Goldsmith J, Salmon J (1987) Automatic creation of object hierarchies for ray tracing. IEEE Comput Graph Appl 7:14–20
Goral CM, Torrance KE, Greenberg DP, Battaile B (1984) Modeling the interaction of light between diffuse surfaces. Comput Graph 18:213–222
Haines E, Wallace J (1991) Shaft culling for ray-traced radiosity. Proceedings of the 2nd Eurographics Workshop on Rendering, Barcelona, Springer-Verlag New York, pp 122–138
Hanrahan P, Salzman D, Aupperle L (1991) A rapid hierarchical radiosity algorithm. Comput Graph 25:197–206
Marks J, Walsh R, Christensen J, Friedell M (1990) Image and intervisibility coherence in rendering. Graph Interface 90:17–29
Ng AWL (1994) Techniques for rapid computation of form factors in radiosity. PhD Thesis and Technical Report No. 680, Department of Computer Science, Queen Mary and Westfield College, University of London, London
O'Rourke J (1994) Computational geometry in C, Cambridge University Press, Cambridge
Preparata FP, Shamos MI (1985) Computational geometry: an introduction, Springer, Berlin Heidelberg New York
Press WH, Flannery BP, Teukolsky SA, Vettering WT (1988) Numerical recipes in C — the art of scientific computing. Cambridge University Press, Cambridge
Ritter J (1990) An efficient bounding sphere. In: Glassner A (ed) Graphics Gems I, pp 301—303
Sommerville D (1959) Analytical geometry of three dimensions. Cambridge University Press, Cambridge
Teller S, Hanrahan P (1993) Global visibility algorithms for illumination computations. Comput Graph 27:239–246
Ullner MK (1983) Parallel machines for computer graphics. PhD Thesis and Technical Report No. 5112, Computer Science Department, California Institute of Technology, Pasadena, Calif
Wallace JR, Elmquist KA, Haines EA (1989) A ray tracing algorithm for progressive radiosity, Comput Graph 23:315–324
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ng, A. A comparison of four visibility acceleration techniques for radiosity. The Visual Computer 12, 307–316 (1996). https://doi.org/10.1007/BF01782292
Issue Date:
DOI: https://doi.org/10.1007/BF01782292