


This is the n = 4 case in a sequence of 8^n × 8^n images that converges to a ⅔–Hölder continuous map from the torus (ℝ/1)² to the RGB cube [0, 1]³. The channel values of adjacent pixels differ by at most 2, 2, or 4 of the 4^n possible R, G, or B values, respectively. I derived this construction with inspiration from R. Stong, Mapping Z^r into Z^s with Maximal Contraction (1998), https://doi.org/10.1007/PL00009375.
https://github.com/andersk/allrgb/blob/main/tartan/src/main.rs
| Date | |
|---|---|
| Colors | 16,777,216 |
| Pixels | 16,777,216 |
| Dimensions | 4,096 × 4,096 |
| Bytes | 94,204 |
