Implementation of a fast box-counting algorithm. We briefly summarize a previously published fast box-counting algorithm for computing the box-count fractal dimension, and adapt it to provide more points on the box-count versus box-size curve. We then present a C language implementation of the algorithm that consists of a routine called boxcount. It uses a flexible memory-addressing scheme that makes it suitable for analyzing multidimensional data, as well as analyzing time-series data efficiently with different embedding dimensions. A stand-alone program that uses boxcount is also presented.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Tolle, Charles R.; McJunkin, Timothy R.; Gorsich, David J.: An efficient implementation of the gliding box lacunarity algorithm (2008)
- Baldovin, Fulvio; Brigatti, Edgardo; Tsallis, Constantino: Quasi-stationary states in low-dimensional Hamiltonian systems (2004)
- Kruger, A.: Implementation of a fast box-counting algorithm (1996)