Implementation of a fast box-counting algorithm

Abstract

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.