engleski

Fast procedure for estimating capacity dimension of the fractal objects by the box counting

A fast procedure for computing fractal dimension by the box counting is derived. An approximation for the number of visited boxes NB(e, n) as a function of n is given. The memory requirement is calculated with this function and the scaling for derivative DN(e, n)/Dn � const �be-a n -b-1 given by Grassberger is obtained for the non saturated segment. The procedure is tested on the calculation of fractal dimension of Sierpinski triangle and the H�non map, and compared with the procedure of Grassberger.

fractal ; dimension ; capacitz dimension ; box counting

nije evidentirano