| | A bit of Fractal Math | |||||||||||
Lets do a bit more math now. Remember the Plusses fractal from a few pages back? One can do a lot of math with this simple fractal. Lets start by finding a simple sequence; that of the number of line ends for each iteration. If you look at the first figure, it is easy to see that there are 4 line ends in the 0th iteration. We now have to figure out how many line ends are added with each iteration. Lets take any one line end to see how it gets transformed to go to the next iteration. Can you see what happens? Remember that the exact same thing happens to each line end. Fractal dimensions. Some of the interesting aspects of fractals has to do with looking at how some of their dimensions evolve as they grow from iteration to iteration. We'll finish this section with two problems that deal with fractal dimensions. Both these problems are not that easy, that is why I have the following offer. If you solve either of them, send me your name and as much information as you want and I'll be very happy to publish it right here. If you attempt to solve it or are simply curious to see the solution, let me know and I'll send you the answer. Problem 1 -- Area and Length of the Plusses Fractal. This problem has to do with calculating two dimensions of the Plusses fractal, the area of the rhombus as well as the total length of all the lines within it. Here are a few hints:
Now, here come the questions to work
on:
Problem 2 -- Total number of +'s on the Plusses Fractal. The next problem that one could work on is to figure out how fast the number of +'s grows. You start with 1, then 5, etc. Finding a formula to predict the total number of +'s for each iteration is not that simple. That is why I'm including a few hints here:
And at this point we are ready to move on to do some actual hands-on growth of some fractals with Java programs.
Last Updated: Sunday, 06-Apr-2003 19:20:33 GMT
|