Path: utzoo!attcan!uunet!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!rutgers!news-server.csri.toronto.edu!dgp.toronto.edu!elf From: elf@dgp.toronto.edu (Eugene Fiume) Newsgroups: comp.graphics Subject: Re: Info on L-systems wanted Keywords: L-systems fractals Message-ID: <1990Nov6.105225.22702@jarvis.csri.toronto.edu> Date: 6 Nov 90 15:52:25 GMT References: <1990Nov5.182451.3591@hellgate.utah.edu> Organization: CSRI, University of Toronto Lines: 26 In article <1990Nov5.182451.3591@hellgate.utah.edu> thomson@cs.utah.edu (Rich Thomson) writes: >I think the defacto reference on L-systems will become: > > _The Algorithmic Beauty of Plants_, > Premizlaw Prusinkeveic (probably spelled wrong, sorry PP! ;-) Przemyslaw Prusinkiewicz (I believe) > >This was just published this year by Springer-Verlag and is written by >one of the most authoritative researchers into L-systems (IMHO) since >Lindenmayer. If by "defacto reference" you mean the application of L-systems to the visual modelling of plants, you're probably right (no disrespect intended). Don't overlook the fact that L-systems have a well-established theory with applications to many areas. For the basic theory, see the badly-titled book: Arto Salomaa, _Jewels of Formal Language Theory_, Computer Science Press, Rockville, Maryland, 1981. The cast of characters who have worked on the theoretical structure of L-systems is large and formidable. -- Eugene Fiume, Dynamic Graphics Project Department of Computer Science, University of Toronto elf@dgp.toronto.edu, (416) 978-5472