“Random numbers for computer graphics” by Patel
Conference:
Type(s):
Title:
- Random numbers for computer graphics
Session/Category Title: New Tricks for Old Dogs
Presenter(s)/Author(s):
Abstract:
A new hashing function, called Goulburn, which is better-suited for computer graphics applications than the popular existing solutions.
References:
1. Jenkins, R. September 1997. Algorithm Alley: Hashing Functions. Dr. Dobb’s Journal.
2. Matsumoto M., and Nishimura T. 1998. Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator, ACM Transactions on Modeling and Computer Simulation 8, 1. 3–30.
3. Noll, L. C. Fowler/Noll/Vo (FNV) Hash. http://www.isthe.com/chongo/tech/comp/fnv/
4. Pearson, P. June 1990. Fast Hashing of Variable-Length Text Strings. Communications of the ACM, 33, 6. 677–680.
5. Uzgalis, R. and Tong, M. 1994. Hashing Myths. Technical Report 97, Department of Computer Science University of Auckland.
6. Wagner, R. May 2003. Mersenne Twister Random Number Generator. http://www-personal.engin.umich.edu/~wagnerr/MersenneTwister.html.
