Citation

Martínez R, Sbert M, Szirmay‐Kalos L. Comput. Grap. Forum 2008; 27(6): 1632-1646.

Copyright

(Copyright © 2008, John Wiley and Sons)

DOI

10.1111/j.1467-8659.2008.01173.x

PMID

unavailable

Abstract

Monte Carlo approaches use random lines to distribute the light power in the scene but the cost of creating a set of random single lines is very costly. In this paper, we present several software and hardware techniques in order to reduce the computational cost of the generation of random single lines by using bundles of parallel lines. The bundle of parallel lines is simulated with a general purpose polygon filling algorithm, like the painter's algorithm. We also present two graphics hardware implementations. The first approach uses two depth buffers in order to represent stochastically a bundle of parallel global lines. The second one uses multiple depth buffers and the aim is to exploit coherence between projection planes for each iteration. All algorithms were implemented with the multipath method.