Abstract
Publisher Summary 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 and that would result in a set of points in desired sampling space with desired density.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
