Coloctree

This is an implementation of an Octree on Color.

My initial goal is to create allRGB images, but you can reuse it for others goals.

It is also a clear and easy to understand Octree implementation (with search for the nearest points), as there aren't so many Octree implementation available on the web.

Examples

There is a bunch of binaries availible with the crate to generate allRGB images.

Here are example of images generated

$Radial - The basic allRGB fractal$

Random walk - Based on randomisation of the order of 8-neighbors

Diamon - Based on the use of 2 buffers to run over pixels

Diamon fixed - Same but process the pixel in order (fixed as "no random")

Square - Same as diamon but with 8neighbors and approximation of the nearest color

Alter - Dimon with mean color of 8neighbors to fix pixel color

To-do

[ ] Implement a k-nearest search, based on a queue and iterative
[ ] Publish a octree implementation that is not specialised for Color (will be another crate)
[ ] Reduce memory usage and remove un-necessary copy
[ ] Use it for color quantization