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 comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15814 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
461 Solvers
-
Minimum Distance between two N-sided Polygons
27 Solvers
-
54 Solvers
-
Check if a matrix is a palindrome in all directions
135 Solvers
More from this Author14
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
