Color palettes are widely used by artists to de ne colors of artworks and explore color designs. In general, artists select the colors of a palette by following a set of rules, e.g. contrast or relative luminance. Existing interactive palette exploration tools explore palette spaces following limited constraints de ned as geometric con gurations in color space e.g. harmony rules on the color wheel. Palette search algorithms sample palettes from color relations learned from an input dataset, however they cannot provide interactive user edits and palette re nement. We introduce in this work a new versatile formulation enabling the creation of constraint-based interactive palette exploration systems. Our technical contribution is a graph-based palette representation, from which we de ne palette exploration as a minimization problem that can be solved e ciently and provide real-time feedback. Based on our formulation, we introduce two interactive palette exploration strategies: constrained palette exploration, and for the rst time, constrained palette interpolation. We demonstrate the performances of our approach on various application cases and evaluate how it helps users nding trade-o s between concurrent constraints.
Other methods for discrete color palette exploration have been proposed, e.g. a constraint-based exploration method of REF .
Constrained palette-space exploration
TOGS
Computer Science