I'd like to create a function to give N equidistant RGB colors. How do we define "distance" in this case? Well, I'm not too sure, but I was thinking to use a color wheel definition.
Hence, if I can create a method such as
public Color colorForAngle(int theta)
Then I would be able to divide 360/N and then extract out the N equidistant colors. Does that make sense? Anyone have a better idea how to get equidistant colors in Java? Anything built in that might help?
The point here is to find N colors that are sufficiently (or as much as possible) dissimilar. For instance, if N was 3, then the colors [255, 0, 0], [0, 255, 0], and [0, 0, 255]
seem as far apart as possible.