We introduce a method to reduce to the real case the calculus of the box-counting dimension of subsets of the unit cube In, n > 1. The procedure is based on the existence of special types of α-dense curves (a generalization of the space-filling curves) in In called δ-uniform curves.This work was partially supported by the grant from the Ministerio de Economía y Competitividad, Spain (MTM 2014-52865-P) to the second author
The problem of finding {if314-1} in n dimensional Euclidean space such that {if314-2}, i = 1, 2, ···...
Abstract: The theory of α−dense curves in the euclidean space Rn, n ≥ 2, was developed for finding a...
witnessing the true exploitation of the interest expressed by the scientific community for the fract...
Abstract. We construct a continuous curve from the interval [0, 1] into the n-dimensional cube [0, 1...
Abstract. This article deals with the numerical computation of the Box-counting dimension of fractal...
In the present work, we consider one category of curves denoted by L(p, k, r, n). These curves are c...
AbstractIf a curve ranges through a cube H = Πni=1[ai, bi] so that, for every point x ∈ H, there is ...
© 2014 Konstantin Igudesman, Roman Lavrenov and Victor Klassen. We introduce new method of calculati...
We consider the problem of computing fractal dimensions by the box-counting method. First, we remark...
© 2020, Springer Nature Switzerland AG. Serial and parallel implementations of the algorithm intende...
Let X be a bounded subset of Rd and write Cu(X) for the set of uniformly continuous functions on X e...
A fractal is a property of self-similarity, each small part of the fractal object is similar to the ...
International audienceNumerical methods which utilize partitions of equal-size, including the box-co...
AbstractThe graphs of coordinate functions of space-filling curves such as those described by Peano,...
We obtain box-counting estimates for the pinned distance sets of (dense subsets of) planar discrete ...
The problem of finding {if314-1} in n dimensional Euclidean space such that {if314-2}, i = 1, 2, ···...
Abstract: The theory of α−dense curves in the euclidean space Rn, n ≥ 2, was developed for finding a...
witnessing the true exploitation of the interest expressed by the scientific community for the fract...
Abstract. We construct a continuous curve from the interval [0, 1] into the n-dimensional cube [0, 1...
Abstract. This article deals with the numerical computation of the Box-counting dimension of fractal...
In the present work, we consider one category of curves denoted by L(p, k, r, n). These curves are c...
AbstractIf a curve ranges through a cube H = Πni=1[ai, bi] so that, for every point x ∈ H, there is ...
© 2014 Konstantin Igudesman, Roman Lavrenov and Victor Klassen. We introduce new method of calculati...
We consider the problem of computing fractal dimensions by the box-counting method. First, we remark...
© 2020, Springer Nature Switzerland AG. Serial and parallel implementations of the algorithm intende...
Let X be a bounded subset of Rd and write Cu(X) for the set of uniformly continuous functions on X e...
A fractal is a property of self-similarity, each small part of the fractal object is similar to the ...
International audienceNumerical methods which utilize partitions of equal-size, including the box-co...
AbstractThe graphs of coordinate functions of space-filling curves such as those described by Peano,...
We obtain box-counting estimates for the pinned distance sets of (dense subsets of) planar discrete ...
The problem of finding {if314-1} in n dimensional Euclidean space such that {if314-2}, i = 1, 2, ···...
Abstract: The theory of α−dense curves in the euclidean space Rn, n ≥ 2, was developed for finding a...
witnessing the true exploitation of the interest expressed by the scientific community for the fract...