Skip to content

Commit b091c5b

Browse files
author
M Joonas Pihlaja
committed
BIBLIOGRAPHY: Cite Hars & Petruska's Pseudorandom Recursions paper.
1 parent 3a82f94 commit b091c5b

File tree

1 file changed

+15
-0
lines changed

1 file changed

+15
-0
lines changed

BIBLIOGRAPHY

+15
Original file line numberDiff line numberDiff line change
@@ -68,6 +68,21 @@ of Bentley-Ottmann:
6868

6969
http://citeseer.ist.psu.edu/pugh90skip.html
7070

71+
The random number generator used in our skip list implementation is a
72+
very small generator by Hars and Petruska. The generator is based on
73+
an invertable function on Z_{2^32} with full period and is described
74+
in
75+
76+
Hars L. and Petruska G.,
77+
``Pseudorandom Recursions: Small and Fast Pseurodandom
78+
Number Generators for Embedded Applications'',
79+
Hindawi Publishing Corporation
80+
EURASIP Journal on Embedded Systems
81+
Volume 2007, Article ID 98417, 13 pages
82+
doi:10.1155/2007/98417
83+
84+
http://www.hindawi.com/getarticle.aspx?doi=10.1155/2007/98417&e=cta
85+
7186
From the result of the intersection-finding pass, we are currently
7287
computing a tessellation of trapezoids, (the exact manner is
7388
undergoing some work right now with some important speedup), but we

0 commit comments

Comments
 (0)