Abstract: Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc between any two points in the fractal has infinite length [Cristea&Steinsky 2009,Cristea&Steinsky 2011]. In the case of mixed labyrinth fractals a sequence of labyrinth patterns is used in order to construct the dendrite. In the present article we focus on the length of the arcs between points of mixed labyrinth fractals. We show that, depending on the choice of the patterns in the sequence, both situations can occur: the arc between any two points of the fractal has finite length, or the arc between any two points of the fractal has infinite length. This is in stark contrast to the self-similar case.
Recommendations
Cites work
- scientific article; zbMATH DE number 7227247 (Why is no real title available?)
- scientific article; zbMATH DE number 44693 (Why is no real title available?)
- Curves of infinite length in 4 4-labyrinth fractals
- Curves of infinite length in labyrinth fractals
- Curves, length, fractal dimension
- Mixed labyrinth fractals
- Modelling porous structures by repeated Sierpinski carpets
- Random walks on random Koch curves
Cited in
(6)
This page was built for publication: On the length of arcs in labyrinth fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744076)
