Estimating box-dimension by sign counting

In this article we examine the possibility of improving the recursive algorithm for computation of box-dimension of complex sets. The known method of box-counting is simplified down to the simple sign counting operation. Our target set is a "cloud" of amorphous points since many fractal sets are given in this form. The key of the algorithm are affine transformations from the world coordinate system to the parametric one and renormalization using as elementary operations as binary dilatation and unit shift transformations. The verification of the quality of results of the generated algorithm is established in the testing phase of the algorithm