Abstract
We extend Kenkel’s model for determining the minimal allowable box size s* to be used in computing the box counting dimension of a self-similar geometric fractal. This minimal size s* is defined in terms of a specified parameter e which is the deviation of a computed slope from the box counting dimension. We derive an exact implicit equation for s* for any e. We solve the equation using binary search, compare our results to Kenkel’s, and illustrate how s* varies with e. A listing of the Python code for the binary search is provided. We also derive a closed form estimate for s* having the same functional form as Kenkel’s empirically obtained expression.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
