Dither test.

Testing four different dithering algorithms written for Grasshopper 2.0 In each case the palette is created by putting all the colours into a kd-tree, then picking the most densely populated leaf-nodes and using the mean colour in those nodes. This allows for the creation of palettes with any amount of unique colours. It is also considerably faster than a k-means approach, although it is probably a lot slower than a median cut approach. Median cuts though seem to only be able to generate palettes with sizes that are powers of two.

10 members like this

View Full Size

Tags:

Comment

You need to be a member of Grasshopper to add comments!

Comment by Cole on August 19, 2019 at 1:18am: Hi David,

Are those Pixels being extruded based on their Color Value? If the are I would love to know how one might go about that, since I'm relatively new to the GH game.

Would you have to somehow make a list specifying light vs. dark color value extrusion heights? Not even sure where to start.

Comment by David Rutten on October 23, 2016 at 6:28pm: And here's an example of a kd-tree used to compute a good 52-colour palette for the same image. All the points inside the regions represent the colours of every pixel in the image.