Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!tut.cis.ohio-state.edu!neuron.cis.ohio-state.edu!kolen-j
From: kolen-j@neuron.cis.ohio-state.edu (john kolen)
Newsgroups: comp.theory.dynamic-sys
Subject: Computing Fractal Dimension
Message-ID: <81951@tut.cis.ohio-state.edu>
Date: 6 Jul 90 19:07:32 GMT
Sender: news@tut.cis.ohio-state.edu
Lines: 22

Very quick question:

Is the standard algorithm for computing fractal dimension from a set of data
points similar to the "Box Counting" theorem in Barnsely's _Fractals
Everywhere_?  That is, for increasing values of n, determine the number of
boxes of size 1/(2^n) to cover the set of points and plot this value with
1/(2^n) on a log-log graph.  The slope of the plotted points (if it exists)
being the resulting dimension.

Thanks

John Kolen
-----------------------------------------------------------------------------
John Kolen (kolen-j@cis.ohio-state.edu)|computer science - n. A field of study
Laboratory for AI Research             |somewhere between numerology and
The Ohio State Univeristy	       |astrology, lacking the formalism of the
Columbus, Ohio	43210	(USA)	       |former and the popularity of the latter
--
John Kolen (kolen-j@cis.ohio-state.edu)|computer science - n. A field of study
Laboratory for AI Research             |somewhere between numerology and
The Ohio State Univeristy	       |astrology, lacking the formalism of the
Columbus, Ohio	43210	(USA)	       |former and the popularity of the latter