Self-similar fractals: an algorithmic point of view

DOI10.1007/s11425-013-4767-xzbMath1305.28023OpenAlexW2254053803MaRDI QIDQ2254823

Kai Zhang, Qin Wang, Li-Feng Xi

Publication date: 6 February 2015

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-013-4767-x

zbMATH Keywords

dimensiondecidabilityfractalseparation condition

Mathematics Subject Classification ID

Fractals (28A80)

Related Items

Algorithms to test open set condition for self-similar set related to P.V. numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Multifractal measures and a weak separation condition
• Projecting the one-dimensional Sierpiński gasket
• A class of self-similar fractals with overlap structure
• On the random series \(\sum\pm\lambda^ n\) (an Erdös problem)
• Iterated Function Systems with Overlaps and Self-Similar Measures
• HAUSDORFF DIMENSION OF SELF-SIMILAR SETS WITH OVERLAPS
• The Hausdorff dimension of self-affine fractals
• Weak separation properties for self-similar sets
• Self-Similar Sets 7. A Characterization of Self-Similar Fractals with Positive Hausdorff Measure
• Separation Properties for Self-Similar Sets
• Fractal geometry, Turing machines and divide-and-conquer recurrences