The C++ code that implements this blog post and generated the images can be found at https://github.com/Atrix256/GoldenRatioShuffle2D. I previously wrote about how to make a one dimensional low discrepancy shuffle iterator at https://blog.demofox.org/2024/05/19/a-low-discrepancy-shuffle-iterator-random-access-inversion/. That shuffle iterator also supported random access and inversion. That is a lot of words, so breaking it down: Shuffle Iterator -…

DemoFox's resource offers insights, tutorials, and resources for graphics programmers and game developers. Readers can learn about rendering techniques, shader programming, and real-time graphics. With articles, tutorials, and code samples, DemoFox provides  guidance and expertise for creating visually stunning and immersive games and simulations.

Bottom of the sea

The post discusses the implementation of a two-dimensional low discrepancy shuffle iterator in C++. A low discrepancy shuffle enables faster convergence for numerical integration compared to a white noise random shuffle. The shuffle supports random access and inversion, allowing quick retrievals of item positions. By mapping 1D shuffle iterator output through the Hilbert or Z-order curves, the author found that the Hilbert curve generally provides better results. The post also includes performance analysis via RMSE graphs and comparative images of different shuffles.

A Two Dimensional Low Discrepancy Shuffle Iterator (+Random Access & Inversion)