Rectfillcurve – generate rectangle-filling curves
Rectfillcurve – generate rectangle-filling curves
How do you visit every coordinate in an NxM grid once? The easiest is to process line-by-line, from the first to last column, but if you want better caching you might try alternating the column direction for each row. The Morton/Z-order and Hilbert order give even better cache coherency for some tasks, although the classic versions only work on squares with power-of-two length sides. Luckily for me, people have developed generalized versions of those algorithms which can handle arbitrary-sized rectangles. I've taken those and packaged all of the those curves into "rectfillcurve", with an iterator API for generating those curves, and a bonus "mlcg curve" with a pseudo-random visit order that should have poor cache behavior. Implemented in stand-alone C, and also available as a Python module.
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Correct prediction on native model
Similar products
Stochastically generate a March Madness bracket
Generate your own mosaic
Generate x86 Assembly with Go
Generate Your Waifu
Generate Yourself – Consumerizing Stable Diffusion
Generate Blocklists by ASN
Generate Ruby bindings from headers with Clang
Generate RDB DDL/DML from GraphDB
Define, Generate, Parse Sequences
Cdef – Generate C Constant Definitions from Matlab Vectors