#### Filter Results:

#### Publication Year

1982

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- JOHN H. HALTON
- 1992

Given a linear system Ax = b, where x is an m-vector, direct numerical methods, such as Gaussian elimination, take time O(m 3) to find x. Iterative numerical methods, such as the Gauss-Seidel method or SOR, reduce the system to the form x = a + Hx, whence x = ∑r=0 ∞ ּ H r a; and then apply the iterations x 0 = a, x s+1 = a + Hx s , until sufficient accuracy… (More)

- John H. Halton
- Inf. Sci.
- 1991

- Philippe Bekaert, Mateu Sbert, John H. Halton
- Rendering Techniques
- 2002

- Mateu Sbert, Francesc Castro, John H. Halton
- Proceedings Computer Graphics International, 2004…
- 2004

In this paper we extend the reuse of paths to the shot from a moving light source. In the classical algorithm new paths have to be cast from each new position of a light source. We show that we can reuse all paths for all positions, obtaining in this way a theoretical maximum speed-up equal to the average length of the shooting path

- Mateu Sbert, Philippe Bekaert, John H. Halton
- Monte Carlo Meth. and Appl.
- 2004

- John H. Halton
- Monte Carlo Meth. and Appl.
- 2006

- Francesc Castro, Mateu Sbert, John H. Halton
- Computers & Graphics
- 2008

- John H. Halton, Routo Terada
- SIAM J. Comput.
- 1982

- JOHN H. HALTON
- 2010

- John H. Halton
- Monte Carlo Meth. and Appl.
- 2008