[plt-scheme] Recursion, graphics, and combinators

Hi all,

I've recently become interested in generating
recursive graphics and in particular Lindenmayer
Systems (L-systems).  Most of this work uses turtle
graphics, which are imperative in nature and so lack
compositionality.  Is anyone aware of functional
approaches to these tasks?

(See many pretty pictures off
http://www.cpsc.ucalgary.ca/Research/bmv/vmm/plates.html
for what some people do with L-systems)

TIA,
Noel

=====
Email: noelwelsh <at> yahoo <dot> com
Jabber: noelw <at> jabber <dot> org

__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free web site building tool. Try it!
http://webhosting.yahoo.com/ps/sb/