FAST RANDOM ROTATION MATRICES
James Arvo, Cornell University, Ithaca, New York
Publisher Summary
This chapter describes a method for generation of uniformly distributed random rotations of a unit sphere and illustrates an efficient procedure for creating random 3 × 3 rotation matrices. The chapter describes a complete algorithm, combining the reflection and simple rotation. The procedure of random rotation requires three uniformly distributed random numbers between 0 and 1. If the three random numbers are obtained by stratified or jittered sampling of the unit cube, the resulting rotation matrices will inherit the benefit of, less clumping. If the range of the random input variables is restricted, then uniformly distributed perturbations ...
Get Graphics Gems III (IBM Version) now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
