Hept Tree
This visualization shows a hept tree that is a particular kind of tree having nodes with exactly 7 children. The hept tree is constructed starting from a random number converted to (→) base 7.
The experiment tries to explain how it is possible to create a Gosper Map, that is a particular kind of Treemap used in our Linked Data Maps approach. Each level of the tree, corresponds to an iteration of the Gosper Space Filling Curve that generates islands. Each island corresponds to a tile: at the first iteration is an hexagon, at the second one is the composition of 7 hexagons, at the thid one the composition of 49 hexagons and so on. Hence, the number hexagons composing an island at the ith iteration is equal to 7^i.
In the diagram, each iteration is reported directly above its corresponding level in the tree. The first iteration is the rightmost corresponding to the leaves of the hept tree.
So, this diagram allows to understand how a GosperMap composed by N hexagons can be constructed in term of islands/tiles. For instance, a GosperMap:
- where N = 6 (base10) → 6 (base7), will have 6 tile of order zero;
- where N = 13 (base10) → 16 (base7), will have 1 tile of order one (= 7 tiles of order zero) and 6 tile of order zero;
- where N = 58 (base10) → 112 (base7), will have 1 tile of order two (= 49 tiles of order zero), one tile of order 1 (= 7 tiles of order zero) and 2 tile of order zero.
Blue, white and lightblue hexagons respectevely represent a full, empty and partially full island.
forked from fabiovalse's block: Hept Tree
forked from anonymous's block: Hept Tree