Abstract: A computer graphics system generates a pixel value for a pixel in an image, the pixel being representative of a point in a scene. The computer graphics system generates the pixel value by an evaluation of an integral of a selected function. The computer graphics system comprises a sample point generator and a function evaluator. The a sample point generator is configured to generate respective sets of sample points each associated with one of a series of rays in a ray trace configured to have a plurality of trace levels. The ray at at least one level can be split into a plurality of rays, with each ray being associated with a ray instance identifier. The sample point generator is configured to generate the sample points as predetermined strictly-deterministic low-discrepancy sequence to which a selected rotation operator is applied recursively for the respective levels.

Abstract: A system and method for generating sample points that can generate the sample points in parallel. The sample points can be used in processing in parallel, with the results subsequently collected and used as necessary in subsequent rendering operations. Sample points are generated using a coarse Halton sequence, which makes use of coarse radical inverse values ?bi,M(j) as follows: ?bi,M(j)=?b(jM+i) where base “b” is preferably a prime number, but not a divisor of “M,” and “i” is an integer. Using this definition, the s-dimensional coarse Halton sequence USCHal,i,M, which may be used to define sample points for use in evaluating integrals, is defined as UsCHal,i,M=(?b1i,M(j), . . . , ?bsi,M(j)) where b1, . . . , bs are the first “s” prime numbers that are not divisors of “M.” Each value of “i” defines a subsequence that is a low-discrepancy sequence, and so can be used in connection with processing.

Abstract: A computer graphics system generate a pixel value for a pixel in an image to simulate global illumination represented by an evaluation of an unknown function ƒ of the form f ? ( x ) = g ? ( x ) + ? 0 1 ? K ? ( x , y ) ? f ? ( y ) ? ? ? ? y , g(x) and K(x,y) known functions, with K(x,y) a “kernel” including a function associated with at least two colors.

Abstract: A system and method for generating sample points that can generate the sample points in parallel. The sample points can be used in processing in parallel, with the results subsequently collected and used as necessary in subsequent rendering operations.

Abstract: A computer graphics system generate a pixel value for a pixel in an image to simulate global illumination represented by an evaluation of an unknown function f of the form f(x)=g(x)+∫01K(x,y)f(y)dy,g(x) and K(x,y) known functions, with K(x,y) a “kernel” including a function associated with at least two colors.

Abstract: A computer graphics system generates a pixel value for a pixel in an image, the pixel being representative of a point in a scene. The computer graphics system generates the pixel value by an evaluation of an integral of a selected function. The computer graphics system comprises a sample point generator and a function evaluator. The a sample point generator is configured to generate respective sets of sample points each associated with one of a series of rays in a ray trace configured to have a plurality of trace levels. The ray at at least one level can be split into a plurality of rays, with each ray being associated with a ray instance identifier. The sample point generator is configured to generate the sample points as predetermined strictly-deterministic low-discrepancy sequence to which a selected rotation operator is applied recursively for the respective levels.