Abstract
Radiosity is a rendering technique that requires a lot of CPU time. The formfactor calculation is the most time-consuming part of the radiosity flow. As a result, accelerating the formfactor calculation becomes an important factor in the improvement of the algorithm. In this paper, we use a geodesic dome to approximate the hemisphere; and to simplify the computation, we represent the dome with a set of points. A kD Tree has been applied to select the clipping area of the projected region. This method is simpler and faster than the hemicube approach, because it avoids time-consuming processing such as that associated with polygon clipping.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I. Ashdown. Radiosity: A Programmer’s Perspective. John Wiley & Sons, Inc., 1994.
D. R. Baum, H. E. Rushmeier, and J. M. Winget. Improving radiosity solutions through the use of analytically determined form-factors. Computer Graphics, 23(3):325–334, 1989.
M. Cohen, S. E. Chen, J. R. Wallace, and D. P. Greenberg. A progressive refinement approach to fast radiosity image generation. Computer Graphics (SIGGRAPH ’88 Proceedings), 22(4):75–84, August 1988.
M. F. Cohen and D. P. Greenberg. The hemicube radiosity solution for complex environments. Computer Graphics (SIGGRAPH ’85 Proceedings), 19(3):31–40, August 1985.
A. Doi and I. Takayuki. Acceleration radiosity solutions through the use of hemisphere-base formfactor calculation. The Journal of Visualization and Computer Animation, 9(1):3–15, 1998.
T. A. Foley, D. A. Lane, G. M. Nielson, and R. Ramaraj. Visualizing functions over a sphere. IEEE Computer Graphics ê4 Application, pages 32–40, January 1990.
N. Gatenby and T. Hewitt. Radiosity in computer graphics: A proposed alternative to the hemi-cube algorithm. Second Eurographics Workshop on Rendering, April 1991.
C. M. Goral, K. E. Torrance, D. P. Greenberg, and Bennett Battaile. Modelling the interaction of light between diffuse surfaces. Computer Graphics (SIGGRAPH ’84 Proceedings), 18(3):212–222, July 1984.
E. Languenou et al. An adaptive discretization method for radiosity. Eurographics, 11(3):C-205–216, 1992.
M. J. Laszlo. Computational Geometry and Computer Graphics in C++. Prentice Hall, 1996.
T. Nishita and E. Nakamae. Continuous tone representation of three-dimensional objects taking account of shadows and interreflection. Computer Graphics (SIGGRAPH ’85 Proceedings), 19(3):23–30, July 1985.
G. Pietrek. Fast calculation of accurate formfactors. Fourth Eurographics Workshop on Rendering, pages 201–220, June 1993.
R. J. Renka. Interpolation of data on the surface of a sphere. ACM Transactions on Mathematical Software, 10(4):417–436, December 1984.
F. Sillion and C. Puech. A general two-pass method intgerating specular and diffuse reflection. ACM SIGGRAPH Computer Graphics, 23(3):335–344, July 1989.
S. N. Spencer. Photorealism in Computer Graphics, chapter The hemisphere radiosity method: A tale of two algorithms, pages 127–135. Springer-Verlag, 1992.
G. C. Van Wyk, Jr. A geometry-based insolation model for computer-aided design. PhD thesis, The University of Michigan, 1988.
J. R. Wallace, Elmquist, K. A., and E. A. Haines. A ray tracing algorithm for progressive radiosity. Computer Graphics, 23(3):315–324, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., Ko, H., Yoon, K. (2000). Acceleration of a Formfactor Calculation through the Use of the 2D Tree. In: Engquist, B., Johnsson, L., Hammill, M., Short, F. (eds) Simulation and Visualization on the Grid. Lecture Notes in Computational Science and Engineering, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57313-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-57313-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67264-7
Online ISBN: 978-3-642-57313-2
eBook Packages: Springer Book Archive