Open GoogleCodeExporter opened 9 years ago
The algorithm is slow because we still have no fast way to map (R,G,B) to color
index. It could be done with an octree, for example. This would also help a lot
with the median cut algorithm for color reduction, as well as making such a
table updated realtime possible.
Also, I'd use "if (same_as[color2]<color2)" instead of "if
(same_as[color2]!=color2)". Doesn't change the result, but reads more easily
for me.
Original comment by PLumeArg...@gmail.com
on 24 Oct 2011 at 7:57
Original issue reported on code.google.com by
yrizoud
on 20 Oct 2011 at 10:01Attachments: