An efficient algorithm to determine fractal dimensions of point sets

DOI10.1016/S0375-9601(01)00339-5zbMath0969.37529OpenAlexW2080866872MaRDI QIDQ5936284

No author found.

Publication date: 10 July 2001

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0375-9601(01)00339-5

zbMATH Keywords

CPU-time consumptionGrassberger-Proccaria approachtree like data structure

Mathematics Subject Classification ID

Approximation methods and numerical treatment of dynamical systems (37M99)

Related Items (3)

Describing some properties of adenylat kinase using fractal concepts ⋮ Using Observed Functional Data to Simulate a Stochastic Process via a Random Multiplicative Cascade Model ⋮ Enhanced box and prism assisted algorithms for computing the correlation dimension

Cites Work

• Noise reduction: Finding the simplest dynamical system consistent with the data
• Generalizations of the Hausdorff dimension of fractal measures.
• Statistical description of chaotic attractors: the dimension function
• Electroencephalograms in epilepsy: Analysis and seizure prediction within the framework of Lyapunov theory
• Indications of nonlinearity, intraindividual specificity and stability of human EEG: The unfolding dimension
• EFFICIENT NEIGHBOR SEARCHING IN NONLINEAR TIME SERIES ANALYSIS
• Ergodic theory of chaos and strange attractors
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm to determine fractal dimensions of point sets