Supermixed labyrinth fractals

JOURNAL OF FRACTAL GEOMETRY(2020)

引用 1|浏览1
暂无评分
摘要
Labyrinth fractals are dendrites in the unit square. They were introduced and studied in the last decade first in the self-similar case [3, 4], then in the mixed case [5, 6]. Supermixed fractals constitute a significant generalisation of mixed labyrinth fractals: each step of the iterative construction is done according to not just one labyrinth pattern, but possibly to several different patterns. In this paper we introduce and study supermixed labyrinth fractals and the corresponding prefractals, called supermixed labyrinth sets, with focus on the aspects that were previously studied for the self-similar and mixed case: topological properties and properties of the arcs between points in the fractal. The facts and formulx found here extend results proven in the above mentioned cases. One of the main results is a sufficient condition for infinite length of arcs in mixed labyrinth fractals.
更多
查看译文
关键词
Fractal,dendrite,graph,tree,Sierpinski carpets,length of paths,arc length
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要