I tested your command. @David_Tschumperle. I don’t understand how it all works, but it’s very much usable to find colors from maximal distance. Only issue is that there’s no option for random colors.
I did a little modification though
non_colormap : skip ${2=1}
check "${1=32}>0"
e[^-1] "Compute a $1-entry colormap of the most different colors from image$?."
v - repeat $! l[$<]
64,64,64,1 eval.. "col = [R,G,B]*(w#-1-1)/255; i(#-1,col) = 1" rm..
$1,1,1,3
repeat w # Find colormap by maximal color distance from existing points
+distance.. 1 col={[xM,yM,zM]} rm.
point.. $col,1,1
point. $>,0,0,1,{[$col]/w#-2*255}
done rm..
l. if $2 +luminance. rv a y sort. +,x rows. 1 fi round endl # Sort colormap by increasing luminance
endl done v +
Added $2 so that you can randomize the order to say for the least.
Here’s the command I tested with it.
1,1,1,3,round(u(0,255))
non_colormap. 14,0
k.
Unlike using 14,1,1,3,round(u(0,255)), this is guaranteed to be never repeat. Mind you, 14 out of 256^3 makes the odd of you hitting the same color at least twice is about .000083446502685546875%.