December 2012
Intermediate to advanced
631 pages
13h 10m
English
Peter Shirley, Indiana University, Bloomington, Indiana
This chapter describes a method for generating transformations that are useful for computer graphics. Several of those transformations can be simplified for simple densities. There are several methods for generating sets of random or pseudorandom points on the unit square, such as jittering and Poisson disk sampling. These methods present a set of N reasonably equidistributed points on the unit square (u1, ν1) through (uN, νN). Sometimes, sampling space may not be square or may not be uniform. It would be better if a mathematical transformation could be written that would take equidistributed points (ui, νi) as input ...
Read now
Unlock full access