Median Cut

Median cut ( engl. median cut, referred to in some programs as median -cut) is a sorting algorithm for n-dimensional data. These are gradually divided into groups of similar values ​​by a set of values ​​is divided at its median.

The algorithm can be used, among other things, for color reduction in digital images. It operates on to a three-dimensional histogram of the image and produces a balanced distribution of the original colors to the colors of the color-reduced image. The color space of the image is divided by the process into smaller cubes until the number of dice equal to the number of desired colors.

• Sorting algorithm
• Algorithm (computer graphics )