Optimal Frame Coherence for Animation in Global Illumination Environment

  • Piotr Napieralski
Part of the Studies in Computational Intelligence book series (SCI, volume 119)


This paper presents an algorithm for animation in global illumination environment for dynamic scenes illuminated by arbitrary, static light sources. Global illumination techniques are difficult to apply for the generation of photorealistic animations because of their high computational costs. These costs are so huge that they take many weeks of computation even on expensive rendering farms, using traditional frame-by-frame rendering systems. Reducing high computational and time costs is of significant practical importance.


Genetic Algorithm Travel Salesman Problem Global Illumination Coherence Matrix Eurographics Workshop 
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.
    Kajiya James T, The Rendering Equation (SIGGRAPH ’86 Proceedings), 20(4):143–150, August 1986.Google Scholar
  2. 2.
    Glassner A, An Overview of Ray Tracing in An Introduction to Ray Tracing, Academic Press Limited, 1989.Google Scholar
  3. 3.
    Napieralski P, Optimization Algorithms for Animate Rendering, IEEE ROC&C’2006 ACAPULCO Mexique, 27 October 2006.Google Scholar
  4. 4.
    Havran Vlastimil, An efficient spatio-temporal architecture for animation rendering, EGRW ’03: Proceedings of the 14th Eurographics Workshop on Rendering, 2003.Google Scholar
  5. 5.
    Wann Henrik Jensen, Rendering Techniques, Proceedings of the Seventh Eurographics Workshop on Rendering, pages 21–30, 1996.Google Scholar
  6. 6.
    Bekaert Philippe, Mateu Sbert, and John Halton. Accelerating path tracing by re-using paths. In EGRW ’02: Proceedings of the 13th Eurographics workshop on Rendering, pages 125–134, Aire-la-Ville, Switzerland, Switzerland, 2002.Google Scholar
  7. 7.
    Besuievsky Gonzalo, A Monte Carlo Approach for Animated Radiosity Environments., PhD Thesis, Barcelona, Spain, 2000.Google Scholar
  8. 8.
    Shelley Kim, Path specification and path coherence, Computer Graphics, 16(3), 1982.Google Scholar
  9. 9.
    Havran Vlastimil, Exploiting temporal coherence in ray-casted walkthroughs, In SCCG ’03: Proceedings of the 19th Spring Conference on Computer Graphics, pages 149–155, New York, NY, USA, 2003. ACM Press, 2003.Google Scholar
  10. 10.
    Applegate David L, The traveling salesman problem: a computational study, Princeton Series in Applied Mathematics, Princeton University Press, 2006.Google Scholar
  11. 11.
    Arvo James. Backward ray tracing. In Developments in Ray Tracing, SIGGRAPH’86 Seminar Notes, Vol. 12, 1996.Google Scholar
  12. 12.
    Balazs C, A Review of Monte Carlo Ray Tracing Methods, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Piotr Napieralski
    • 1
  1. 1.Institute of Computer ScienceTechnical University of Lodz, University of LittoralCôte d’OpaleFrance

Personalised recommendations