On 17/09/2016 06:32, Дмитрий Мехонцев wrote:
Hi!
Here Fractint ifs representation:
OvoidTile {
0.25 0.25 0.25 -0.25 0 0.5 0.125
-0.25 0.25 -0.25 -0.25 -0.25 0.25 0.125
-0.25 -0.25 -0.25 0.25 -0.25 0.25 0.125
-0.25 0.25 0.25 0.25 -0.25 0.25 0.125
-0.25 0.25 -0.25 -0.25 0 0.5 0.125
0.25 0.25 -0.25 0.25 -0.25 0.25 0.125
-0.25 0.25 0.25 0.25 -0.5 0.5 0.125
-0.25 -0.25 -0.25 0.25 0 0 0.125
}
Thanks.
It turns out that there are more easily accessible octapletals than I
thought. Each c2-symmetric octapletal seems to have 3 c2-symmetric
demitiles (plus 117 other demitiles), which leads to quite a few tiles
in total.
Some of the symmetric demitiles are broken into 2 or 4 parts, but from
these you can get to a connected tile after another 1 or 2 iterations.
The questions that arise are is the set of c2-symmetric octapletals
finite or infinite, and if finite how many members does it have. (I
haven't demonstrated the existence of cycles in the iteration yet, but I suspect that they exist.)
The other approaches I have for generating octapletals are dissecting
the dipletals, and producing dipletal-tetrapletal product fractals. With
5 reflected elements the ovoid tile isn't going to fall out directly
from either of the latter.
--
SRH
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)