Extend the work of issue #63 through relaxation of exact match to allow distances obtained by taking the 2-norm (Euclidean norm) over the subset [0,255]^3 of R^3, where each axis is one of the color values in an RGB triple.
Note that it is not clear that this metric is the best choice. E.g., what about a weighted norm on HSV vectors? In any case, the implementation can serve as the basis for later work that involves more sophisticated metrics and vector spaces obtained from colors.
Extend the work of issue #63 through relaxation of exact match to allow distances obtained by taking the 2-norm (Euclidean norm) over the subset [0,255]^3 of R^3, where each axis is one of the color values in an RGB triple.
Note that it is not clear that this metric is the best choice. E.g., what about a weighted norm on HSV vectors? In any case, the implementation can serve as the basis for later work that involves more sophisticated metrics and vector spaces obtained from colors.
This task depends on #66