References
- Lambert. 1760 Photometria sive de mensura et Gradibus luminis, colorum et Umbrae. Augsberg. pp. 66–74.
- SillionF. and PuechC.. 1994. Radiosity and Global Illumination. Kaufmann. pp. 100–102.
- Sillion, and AshdownI. 1994. Radiosity: A Programmer's Perspective. Wiley. Chapter 5. pp. 47–53;
- PaulinM. and CabetR.. 1996. Computing the radiosity gradient for partially occluded polygons. Proceedings of the Fifth International Conference on Computational Graphics and Visualization Techniques.
- ArvoJ. 1994. The Irradiance Jacobian for partially occluded polyhedral sources. Computer Graphics Proceedings, Annual Conference Series, pp. 343–350.
- DiLauraD., SantoroS. MillerT., and TerchG. 1998. Non-diffuse Radiative Transfer 5: Calculation of Occluded Form Factors. J of the IESNA. 27(No. 2). pp. 77–82.
- GouldC. 1998. “Application of the Fourier Transform to Diffuse Radiative Transfer”. Thesis, University of Colorado at Boulder, pp. 41–63.
- SeiderC. 2000. “A New Method for Calculating Occluded Configuration Factors in Radiative Transfer Analysis”. Thesis, University of Colorado at Boulder.
- AblowitzM.J. and FokasAS. 1997. Complex Variables: Introduction and Applications. Cambridge, pp. 206–245.
- AshdownI. 1994. Radiosity: A Programmers Perspective. Wiley, p. 386. Use of a binary space partition tree for cataloguing the polygons in a system is one way in which this can be arranged. Another, and simpler, is to using a bounding box that contains the emitting and receiving polygon and a polygons intersecting the box.
References
- HillF.S.Jr. 2001. Computer Graphics Using Open GL. Upper Saddle River, NJ: Prentice Hall.
- BalabanI.J. 1995. “An Optimal Algorithm for Finding Segment Intersection,” Proc. Eleventh Annual ACM Symposium on Computational Geometry, pp. 211–219.
- BadouelD. 1990. “An Efficient Ray-Polygon Intersection”. in Graphic Gems. pp. 390–393. San Francisco, CA: Academic Press.
- CohenM.F. and WallaceJ.R. 1993. Radiosity and Realistic Image Synthesis. San Francisco, CA: Academic Press.