A fast procedure for computing fractal dimension by the box counting is derived. Anapproximation for the number of visited boxes NB( face="symbol">e,n)as a function of n is given. The memory requirement is calculated with this function andthe scaling for derivative
展开▼
机译:推导了一种通过盒数计算分形维数的快速程序。给出了访问量N B sub>( face =“ symbol”> e font>,n)随n的近似值。使用此函数计算内存需求,然后按比例缩放
展开▼