I'm trying to create an algorithm that will output a set of different RGB color values, that should be as distinct as possible. For Example:
following a set of 3 colors:
- (255, 0, 0) [Red]
- (0, 255, 0) [Green]
- (0, 0, 255) [Blue]
the next 3 colors would be:
- (255, 255, 0) [Yellow]
- (0, 255, 255) [Cyan]
- (255, 0, 255) [Purple]
The next colors should be in-between the new intervals. Basically, my idea is to traverse the whole color spectrum systematic intervals similar to this:
A set of 13 colors should include the color in between 1 and 7, continue that pattern infinitely.
I'm currently struggling to apply this pattern to an algorithm to RGB values as it does not seem trivial to me. I'm thankful for any hints that can point me to a solution.