OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM

DOI10.1142/S0218127410028197MaRDI QIDQ3086297zbMATH OpenFDO

Authors Panagiotis D. Alevizos, Michael N. Vrahatis

Publication date 30 March 2011

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218127410028197

zbMATH Keywords

box-countingfractal dimensionHénon mapquadtree

Mathematics Subject Classification ID

Fractals (28A80) Dimension theory of smooth dynamical systems (37C45)

Recommendations

• Implementation of a fast box-counting algorithm
• Approximate counting by dynamic programming
• Box-counting by Hölder's traveling salesman
• Parameterized algorithms for boxicity
• Efficient counting with optimal resilience
• Efficient counting with optimal resilience
• scientific article; zbMATH DE number 1067837
• A combinatorial branch-and-bound algorithm for box search

Cites work

• A two-dimensional mapping with a strange attractor
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Implementation of a fast box-counting algorithm

Cited in

(7)

• Implementation of a fast box-counting algorithm
• Efficient algorithm for box folding
• Multi-granularity and time-varying fractal dimension on data stream
• A MODIFIED BOX-COUNTING METHOD
• Efficient Algorithm for Box Folding
• An efficient algorithm to determine fractal dimensions of point sets
• A new method of estimation of the box-counting dimension of multivariate objects using space-filling curves

This page was built for publication: OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086297)