|
|
3 of 3 people found the following review helpful:
5.0 out of 5 stars
A Excellent Introduction to Fractals, June 21, 2001
By A Customer
This book is nicely written, well-organized and beautifully illustrated. It introduces most of the standard topics with a minimum of math, for example, iterated function systems, chaos, Mandelbrot and Julia sets, and random fractals. Among introductory semi-formal treatments of fractals I have seen, it strikes the best balance between concision, simplicity, and mathematical detail. However, this somewhat dated volume needs a revision to upgrade the code from Basic to, say, Java. When the book was first published, microcomputers were relatively weak. Consequently, the book makes a few digressions into some rather involved algorithms designed to minimize memory use. Of course, today's machines are much more powerful. It is a lot simpler to use recursion (although this uses up memory liberally) in the fractal programs. Finally, I think that the geometry could be made conceptually cleaner by mentioning that a general similitude (of which a contraction mapping is one example) on the plane can be written as a composition of rotations, translations, reflections, and scalings. For more substantial treatments of fractals that don't demand too much math background, see "Fractals Everywhere" by M. Barnsley and "Introduction to Fractals and Chaos" by R. Crownover. However, one should read Lauwerier's slim and elegant volume before and after studying these more advanced works--before, as an introduction, and after, as a delightful summary and "bird's eye view" of the subject.
|