Abstract
Skeleton is a new notion designed for constructing space-filling curves of self-similar
sets. In a previous paper by Dai and the authors [1], it was shown that for all connected
self-similar sets with a skeleton satisfying the open set condition, space-filling curves can be
constructed. In this paper, we give a criterion of existence of skeletons by using the so-called
neighbor graph of a self-similar set. In particular, we show that a connected self-similar set
satisfying the finite type condition always possesses skeletons: an algorithm is obtained here.
sets. In a previous paper by Dai and the authors [1], it was shown that for all connected
self-similar sets with a skeleton satisfying the open set condition, space-filling curves can be
constructed. In this paper, we give a criterion of existence of skeletons by using the so-called
neighbor graph of a self-similar set. In particular, we show that a connected self-similar set
satisfying the finite type condition always possesses skeletons: an algorithm is obtained here.
Original language | English |
---|---|
Article number | 2050028 |
Journal | Fractals |
Volume | 28.2020 |
Issue number | 2 |
DOIs | |
Publication status | Published - 12 Mar 2020 |
Bibliographical note
Publisher Copyright:© 2020 World Scientific Publishing Company.
Keywords
- Self-similar se
- Skeleton
- Finite type condition
- Space-filling curves
- Self-Similar Set
- Finite Type Condition
- Space-Filling Curves