Implementation of a fast box-counting algorithm

Published: 1 January 1996| Version 1 | DOI: 10.17632/v6kh87zmfw.1
Contributor:
A. Kruger

Description

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. A stan... Title of program: boxcount and boxdim Catalogue Id: ADDW_v1_0 Nature of problem Numerical estimation of the fractal dimension of time series and multidimensional data. Versions of this program held in the CPC repository in Mendeley Data ADDW_v1_0; boxcount and boxdim; 10.1016/0010-4655(96)00080-X This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)

Files