Amortized Noise
نویسنده
چکیده
A new noise generation algorithm called amortized noise generates smooth noise using dynamic programming techniques to amortize the cost of floating point multiplications over neighboring points. The amortized 2D noise algorithm uses a factor of 17/3 ≈ 5.67 fewer floating point multiplications than the 2D Perlin noise algorithm, resulting in a speedup by a factor of 3 in practice on current desktop computing hardware. The amortized 3D noise algorithm uses a factor of 40/7 ≈ 5.71 fewer floating point multiplications than the 3D Perlin noise algorithm, but the increasing overhead for the initialization of tables limits the speedup factor achieved in practice to around 2. In addition to being significantly faster, amortized noise is less prone to repeat at regular intervals than Perlin noise, and it is smoother since it uses quintic splines in place of cubic splines.
منابع مشابه
Tobler's First Law of Geography, Self Similarity, and Perlin Noise: A Large Scale Analysis of Gradient Distribution in Southern Utah with Application to Procedural Terrain Generation
A statistical analysis finds that in a 160,000 square kilometer region of southern Utah gradients appear to be exponentially distributed at resolutions from 5m up to 1km. A simple modification to the Perlin noise generator changing the gradient distribution in each octave to an exponential distribution results in realistic and interesting procedurally generated terrain. The inverse transform sa...
متن کاملOur Data, Ourselves: Privacy Via Distributed Noise Generation
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to create a distributed implementation of the privacy-preserving statistical databases described in recent papers [14, 4, 13]. In these databases, privacy is obtained by perturbing the true answer to a database query by the ...
متن کاملThe Amortized Bootstrap
We use amortized inference in conjunction with implicit models to approximate the bootstrap distribution over model parameters. We call this the amortized bootstrap, as statistical strength is shared across dataset replicates through a metamodel. At test time, we can then perform amortized bagging by drawing multiple samples from the implicit model. We find amortized bagging outperforms bagging...
متن کاملIcs 691: Advanced Data Structures Lecture 2 2 Searching a List 2.1 Static Structure
In the last lecture we discussed amortized analysis and looked at the 3 methods: aggregate, accounting, and potential. We used these 3 methods to show that the amortized complexity of the binary counter problem is O(n). Finally, we applied amortized analysis to the problem of inserting data into dynamic arrays, showing that inserting n objects has an amortized cost of O(n), despite the worst-ca...
متن کاملAmortized Communication Complexity
In this work we study the direct-sum problem with respect to communication complexity: Consider a relation f deened over f0; 1g n f0; 1g n. Can the communication complexity of simultaneously computing f onìnstances (x 1 ; y 1); : : : ; (x ` ; y `) be smaller than the communication complexity of computing f on thè instances, separately? Let the amortized communication complexity of f be the comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013