Problem 46838. The most decentralized RGB colors
Input number of colors and try to find the most decentralized combination.
For n=1, any color is OK.
For n=2, the 2 colors should have an euclidean distance of sqrt(255^2*3), such as [0 0 0] and [255 255 255].
For n=3, the 3 colors have 3 distances. We measure the smallest one, which should be sqrt(255^2*2). One possible combination may be [255 255 255;255 0 0;0 0 255].
For n=8, apparently we capture the 8 vertecies of the cube, the smallest distance is 255.
Then, more?
Your function should return a n×3 matrix with each row represent an RGB color.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers2
Suggested Problems
-
Count from 0 to N^M in base N.
235 Solvers
-
Back to basics 19 - character types
261 Solvers
-
Pig Latin to English Translator
153 Solvers
-
484 Solvers
-
Chebyshev polynomials of the 2nd Kind
68 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!