How to transverse the whole RGB cube for a 16.7 million color gradient

Asked Nov 21 '16 at 17:16

Active Nov 22 '16 at 15:10

Viewed 176 times

Assume a color space defined by a 256*256*256 RGB cube. A 1d color gradient is formed by transversing the cube over some path between two points e.g. 1, 2. These are examples of a path that covers only part of the color space. I am interested in a 1d path to transverse all points in the cube continuously and form a 16.7 million color gradient. Are there any known formulations for this?

Edit: this is one possible answer: Algorithm for generating a 3D Hilbert space-filling curve in Python

Edit2: this shows some implementations: http://www.alanzucconi.com/2015/09/30/colour-sorting/

6 segment gradient

color paths see fig 10.22

edited Nov 22 '16 at 15:10

asked Nov 21 '16 at 17:16

o17t H1H' S'k

2,541
5
31
52

1

might be a good fit also for http://math.stackexchange.com/ – matanster Nov 22 '16 at 04:59
1

You mean something like https://en.wikipedia.org/wiki/Hilbert_curve#/media/File:Hilbert3d-step3.png but then for a 256*256*256 cube? So what's the problem? – Freek Wiedijk Jan 23 '17 at 10:59

How to transverse the whole RGB cube for a 16.7 million color gradient

0 Answers0