【发布时间】:2011-05-26 20:22:14
【问题描述】:
我提交了不同颜色的十六进制。目前我正在使用 rgb2hex 函数,所以要么或工作。 目标是我有一组需要使用的颜色,并且我希望现有的颜色 hex 或 rgb 更改为最接近数组或其他颜色的颜色。
基本上,我有大约 15 个颜色值,并且我基本上想要一个函数,它接受 rgb 并查看它最接近(数组的)哪个
【问题讨论】:
-
您可能需要考虑使用完全不同的颜色模型。
我提交了不同颜色的十六进制。目前我正在使用 rgb2hex 函数,所以要么或工作。 目标是我有一组需要使用的颜色,并且我希望现有的颜色 hex 或 rgb 更改为最接近数组或其他颜色的颜色。
基本上,我有大约 15 个颜色值,并且我基本上想要一个函数,它接受 rgb 并查看它最接近(数组的)哪个
【问题讨论】:
编辑:您是否曾经在 Google 上四处寻找某些东西却只是为了找到您自己的答案?这是一个可能更有用的函数,因为它是独立的:
function convertToClosest($c) {
// set minimum difference you'll allow between colors
$minDiff = 1000;
// generate color array
$colorArrayOriginal = array(
"black" => "000000",
"brown" => "6E4700",
"gray" => "555555",
"white" => "FFFFFF",
"red" => "EB0000",
"orange" => "FF9914",
"yellow" => "FFF71C",
"green" => "1BB500",
"blue" => "005BB5",
"purple" => "4E00B5"
);
foreach ($colorArrayOriginal as $colorID => $color) {
$r = substr($color,0,2);
$g = substr($color,2,2);
$b = substr($color,4,2);
$colorArray[$colorID] = array($r,$g,$b);
}
// here, we break apart the color we input, $c
$r = substr($c,0,2);
$g = substr($c,2,2);
$b = substr($c,4,2);
$inHex = array($r,$g,$b);
$color = false;
// we define the "best so far" variable as the min, since we can't have a best that's more
$bestDiff = $minDiff;
// here, we parse through each of the colors finding the closest, using the native hexdec function to parse
// out the best values to compare
foreach ($colorArray as $colorID => $cc) {
$diff = abs(hexdec($inHex[0]) - hexdec($cc[0])) + abs(hexdec($inHex[1]) - hexdec($cc[1])) + abs(hexdec($inHex[2]) - hexdec($cc[2]));
// if the difference in value between the colors is less than the best one of all the ones we've tried...
if ($diff<=$bestDiff) {
$color = $colorID;
$bestDiff = $diff;
}
}
return $color;
}
这是原文:
function convertToClosest($c,$colorArray) {
// here, we break apart the color we input, $c
$r = substr($c,0,2);
$g = substr($c,2,2);
$b = substr($c,4,2);
$inHex = array($r,$g,$b);
$color = false;
// we define the "best so far" variable as the min, since we can't have a best that's more
$bestDiff = $minDiff;
// here, we parse through each of the colors finding the closest, using the native hexdec function to parse
// out the best values to compare
foreach ($colorArray as $colorID => $cc) {
$diff = abs(hexdec($inHex[0]) - hexdec($cc[0])) + abs(hexdec($inHex[1]) - hexdec($cc[1])) + abs(hexdec($inHex[2]) - hexdec($cc[2]));
// if the difference in value between the colors is less than the best one of all the ones we've tried...
if ($diff<=$bestDiff) {
$color = $colorID;
$bestDiff = $diff;
}
}
return $color;
}
另外,如果你想生成 $colorArray 变量
$colorArrayOriginal = [two dimensional array of your colors ]
foreach ($colorArrayOriginal as $c) {
$r = substr($c["hex"],0,2);
$g = substr($c["hex"],2,2);
$b = substr($c["hex"],4,2);
$colorArray["$c[id]"] = array($r,$g,$b);
}
【讨论】:
如果我理解正确,您想将任意十六进制颜色近似为预定义?
创建一个函数来分割 r-g-b,包括输入和矩阵。
$inHex = array(r,g,b);
$colArray = array(array(r1,g1,b1),array(...))
$minDiff = 10000;
$color = false;
for($i=0;$i<sizeof($colArray);$i++) {
$diff = abs($inHex(0) - $colArray[$i][0]) +
abs($inHex(1) - $colArray[$i][2]) +
abs($inHex(2) - $colArray[$i][2]);
if ($diff<$minDiff) $color = $i;
}
//ok, $color is pointing at closest color..
问候, //t
【讨论】: