ON EFFICIENT BOX COUNTING ALGORITHMS

Peter Grassberger
Additional contact information
Peter Grassberger: Physics Department, University of Wuppertal, D-5600 Wuppertal 1, Germany

International Journal of Modern Physics C (IJMPC), 1993, vol. 04, issue 03, 515-523

Abstract: 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.

Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183193000525
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:04:y:1993:i:03:n:s0129183193000525

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183193000525

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().