Height Field Arrays of size 2n+1, and their corresponding Implicit Binary Triangle Trees
n | size of array ( 2n + 1 ) |
size of array, Seumas's wraparound-way ( 2n ) |
levels of the bintree ( 2n + 2 ) |
number of nodes in the bintree ( 2levels - 1 ) |
|
---|---|---|---|---|---|
0 | 2 x 2 (4) |
1 x 1 | 2 | 3 | |
1 | 3 x 3 (9) |
2 x 2 | 4 | 15 | |
2 | 5 x 5 (25) |
4 x 4 | 6 | 63 | |
3 | 9 x 9 (81) |
8 x 8 | 8 | 255 | |
4 | 17 x 17 (289) |
16 x 16 | 10 | 1023 | |
... | ... | ... | ... | ... | |
8 | 257 x 257 ~64K |
16 x 16 | 18 | ~256K | |
10 | 1K x 1K (~1M) |
16 x 16 | 18 | ~4M |