ON EFFICIENT BOX COUNTING ALGORITHMS
Peter Grassberger · International Journal of Modern Physics C · 1993
We present two variants of a fast and storage efficient algorithm for box counting of fractals and fractal measures. In contrast to recently proposed algorithms, no sorting of the data is done. With comparable storage demands, CPU times are between 1 and 2 orders of magnitude lower than those needed with the latter algorithms.