coloctree 0.1.1

An octree implementation for RGB Color to create all RGB images.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

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](https://git.ache.one/coloctree/plain/res/all_rgb_radial_512.png?h=%f0%9f%aa%b5)

![Random walk - Based on randomisation of the order of 8-neighbors](https://git.ache.one/coloctree/plain/res/all_rgb_randomwalk_512.png?h=%f0%9f%aa%b5)

![Diamon - Based on the use of 2 buffers to run over pixels](https://git.ache.one/coloctree/plain/res/all_rgb_diamon_512.png?h=%f0%9f%aa%b5)

![Diamon fixed - Same but process the pixel in order (fixed as "no random")](https://git.ache.one/coloctree/plain/res/all_rgb_diamon_fixed_512.png?h=%f0%9f%aa%b5)

![Square - Same as diamon but with 8neighbors and approximation of the nearest color](https://git.ache.one/coloctree/plain/res/all_rgb_square_512.png?h=%f0%9f%aa%b5)

![Alter - Dimon with mean color of 8neighbors to fix pixel color](https://git.ache.one/coloctree/plain/res/all_rgb_alter_512.png?h=%f0%9f%aa%b5)

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