Hanoi attractors and the Sierpiński gasket
暂无分享,去创建一个
The famous game Towers of Hanoi is related with a family of so-called Hanoi-graphs. We regard these non-self-similar graphs as geometrical objects and obtain a sequence of fractals (HGα)α converging to the Sierpinski gasket which is one of the best studied fractals. It is shown that this convergence holds not only with respect to the Hausdorff distance, but that also Hausdorff dimension does converge. Moreover, it is shown that each of the approximating sets has non-trivial Hausdorff measure.
[1] S. Klavžar,et al. Graphs S(n, k) and a Variant of the Tower of Hanoi Problem , 1997 .
[2] A. M. Hinz,et al. The average distance on the Sierpiński gasket , 1990 .
[3] S. Krantz. Fractal geometry , 1989 .
[4] Jun Kigami,et al. Harmonic calculus on p.c.f. self-similar sets , 1993 .