PROCESS FOR PREPARING A COLOUR CHART
First Claim
1. A process for arranging a plurality of colours or coloured objects in a defined sequence so that each colour or coloured object has at least one neighbouring colour or coloured object, comprising the steps ofa) assigning all colours or coloured objects a position in an at least two-dimensional colour space,b) assigning all neighbouring colours or coloured objects a colour difference value corresponding to the a length of a vector connecting the neighbouring colours in the colour space,c) assigning a direction to every vector in the colour space connecting two neighbouring colours or coloured objects,d) arranging the sequence of colours or coloured objects in such a way that an overall sum ofi. all colour difference values over the sequence andii. all direction difference values of two consecutive vectorsis minimized, and wherein a weight factor x is assigned to a sum of all colour difference values and a weight factor y is assigned to a sum of all direction difference values of two consecutive vectors prior to the minimization of the overall sum, and wherein at least one of x or y is not zero.
1 Assignment
0 Petitions
Accused Products
Abstract
The invention relates to a process for arranging a plurality of colours or coloured objects in a defined sequence so that each colour or coloured object has at least one neighbouring colour or coloured object, comprising the steps of a) assigning all colours or coloured objects a position in an at least two-dimensional colour space, b) assigning all neighbouring colours or coloured objects a colour difference value corresponding to the length of a vector connecting the neighbouring colours in the colour space, c) assigning a direction to every vector in the colour space connecting two neighbouring colours or coloured objects, d) arranging the sequence of colours or coloured objects in such a way that the overall sum of i. all colour difference values over the sequence and ii. all direction difference values of two consecutive vectors is minimized, and wherein a weight factor x is assigned to the sum of all colour difference values and a weight factor y is assigned to the sum of all direction difference values of two consecutive vectors prior to minimization of the overall sum, and wherein at least one of x and y is not zero.
-
Citations
20 Claims
-
1. A process for arranging a plurality of colours or coloured objects in a defined sequence so that each colour or coloured object has at least one neighbouring colour or coloured object, comprising the steps of
a) assigning all colours or coloured objects a position in an at least two-dimensional colour space, b) assigning all neighbouring colours or coloured objects a colour difference value corresponding to the a length of a vector connecting the neighbouring colours in the colour space, c) assigning a direction to every vector in the colour space connecting two neighbouring colours or coloured objects, d) arranging the sequence of colours or coloured objects in such a way that an overall sum of i. all colour difference values over the sequence and ii. all direction difference values of two consecutive vectors is minimized, and wherein a weight factor x is assigned to a sum of all colour difference values and a weight factor y is assigned to a sum of all direction difference values of two consecutive vectors prior to the minimization of the overall sum, and wherein at least one of x or y is not zero.
Specification