2018
DOI: 10.1016/j.chaos.2018.05.025
|View full text |Cite
|
Sign up to set email alerts
|

Box-counting dimensions of generalised fractal nests

Abstract: Fractal nests are sets defined as unions of unit nspheres scaled by a sequence of k −α for some α > 0. In this article we generalise the concept to subsets of such spheres and find the formulas for their box counting dimensions. We introduce some novel classes of parameterised fractal nests and apply these results to compute the dimensions with respect to these parameters. We also show that these dimensions can be seen numerically. These results motivate further research that may explain the unintuitive behavi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…One way to calculate the area of the region R limited by the graph of a non-negative function y = f (x) continues in an interval [a, b] and the lines x = a, x = b, and y = 0, is to use the Box Counting Method (BC), [10][11][12][13][14][15] summarized as follows. Algorithm BC is based on filling the space of a set (surface in this case) with a set of objects of the same area or boxes N (δ) as a function of the size δ of the coverings (or boxes).…”
Section: Box Counting Algorithmmentioning
confidence: 99%
“…One way to calculate the area of the region R limited by the graph of a non-negative function y = f (x) continues in an interval [a, b] and the lines x = a, x = b, and y = 0, is to use the Box Counting Method (BC), [10][11][12][13][14][15] summarized as follows. Algorithm BC is based on filling the space of a set (surface in this case) with a set of objects of the same area or boxes N (δ) as a function of the size δ of the coverings (or boxes).…”
Section: Box Counting Algorithmmentioning
confidence: 99%
“…For some other examples of "irregular" spiral trajectories and the calculation of their box dimensions and Minkowski content see e.g. [2,18,20,24,27,26]. In this paper we will often speak about a trajectory "near the origin (x, y) = (0, 0)".…”
Section: Introductionmentioning
confidence: 99%
“…There are various algorithms for calculating FD, including the box-counting (BC) algorithm [20], the Katz algorithm [21], and the Higuchi algorithm [22]. The Higuchi and box-counting algorithms have been widely used due to their practical applicabilities and fast speed [23][24][25][26]. In our previous study, a roughness scaling extraction (RSE) algorithm was proposed [27,28], and it has a higher accuracy and anti-noise performance compared with other traditional algorithms.…”
Section: Introductionmentioning
confidence: 99%