On the complexity of some rendering algorithms

Benjamin Mora

(Swansea University)

Complexity of rendering 3D scenes with ray-tracing is usually described as logarithmic in publications focusing on this area of Computer Graphics. In this presentation, I will discuss on the complexity of some rendering algorithms, and demonstrate that complexity can actually been improved by exploiting spatial coherency in 3D renderings in a better way. If time permits, a new technique for storing and representing light fields will also be presented.
Tuesday 18th November 2008, 14:00
Robert Recorde Room
Department of Computer Science