Hierarchical Radiosity On Curved Surfaces

  • Stephan Schäfer
Conference paper
Part of the Eurographics book series (EUROGRAPH)


Incorporating curved objects into a hierarchical radiosity system typically bears a great disadvantage: the initial tessellation already needs a large number of small polygons because further mesh enhancement is impossible. We will show that improvements in rendering speed and quality can be made by extending the planar meshing of the refinement step to an object-specific subdivision scheme. While keeping the number of input polygons extremely low an arbitrary accuracy of the solution can be obtained.


Global Illumination Scene Object Curve Object Small Polygon Flatness Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Bao and Q. Peng. A Progressive Radiosity Algorithm for Scenes Containing Curved Surfaces. Computer Graphics Forum (Eurographics ‘83), 12 (3): C399–C408, September 1993.MathSciNetCrossRefGoogle Scholar
  2. 2.
    H. Bao and Q. Peng. An Efficient Form-Factor Evaluation Algorithm for Environments with Curved Surfaces. Computers & Graphics, 18 (4): 481–486, April 1994.CrossRefGoogle Scholar
  3. 3.
    B. G. Baumgart. A polyhedron representation for computer vision. In Nat. Comp. Conf. 44, pages 589–596. AFIPS, 1975.Google Scholar
  4. 4.
    Heinzgerd Bendels, Dieter W. Fellner, and Stephan Schäfer. Hierarchical radiosity on topological data structures. In B. Girod, H. Niemann, and H.-P. Seidel, editors, 3D Image Analysis and Synthesis ‘86, pages 111–118. infix, 1996.Google Scholar
  5. 5.
    Michael E. Cohen and John R. Wallace. Radiosity and Realistic Image Synthesis. Academic Press Professional, Boston, MA, 1993.MATHGoogle Scholar
  6. 6.
    Simon Gibson and R. J. Hubbold. Efficient hierarchical refinement and clustering for radiosity in complex environments. Computer Graphics Forum, 15 (5): 297–310, December 1996.Google Scholar
  7. 7.
    Pat Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics, 25 (4): 197–206, July 1991.CrossRefGoogle Scholar
  8. 8.
    G.R. Jones, C. G. Christou, B. G. Cumming, A. J. Parker, and A. Zisserman. Accurate Rendering of Curved Shadows and Interreflections. Fourth Eurographics Workshop on Rendering, (Series EG 93 RW): 337–345, June 1993.Google Scholar
  9. 9.
    Dani Lischinski, Brian Smits, and Donald P. Greenberg. Bounds and Error Estimates for Radiosity. Computer Graphics Proceedings, Annual Conference Series, 1994 (ACM SIG-GRAPH ‘84 Proceedings), pages 67–74, 1994.Google Scholar
  10. 10.
    Tomoyuki Nishita and Eihachiro Nakamae. A New Radiosity Approach Using Area Sampling for Parametric Patches. Computer Graphics Forum (Eurographics ‘83), 12 (3): C385–C398, September 1993.CrossRefGoogle Scholar
  11. 11.
    Francois Sillion. A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters. IEEE Transactions on Visualization and Computer Graphics, 1 (3), September 1995.Google Scholar
  12. 12.
    Brian Smits, James Arvo, and Donald Greenberg. A Clustering Algorithm for Radiosity in Complex Environments. Computer Graphics Proceedings, Annual Conference Series, 1994 (ACM SIGGRAPH ‘84 Proceedings), pages 435–442, 1994.Google Scholar
  13. 13.
    Harold R. Zatz. Galerkin Radiosity: A Higher Order Solution Method for Global Illumination. Computer Graphics Proceedings, Annual Conference Series, 1993 (ACM SIGGRAPH ‘83 Proceedings), pages 213–220, 1993.Google Scholar

Copyright information

© Springer-Verlag/Wien 1997

Authors and Affiliations

  • Stephan Schäfer
    • 1
  1. 1.Department of Computer ScienceUniversity of BonnBonnGermany

Personalised recommendations