LindenmayeR: Functions to Explore L-Systems (Lindenmayer Systems)

Lindenmayer or L-systems are parallel rewriting systems which can be used to simulate biological forms and certain kinds of fractals. Briefly, in an L-system a series of symbols in a string are replaced iteratively according to rules to give a more complex string. Eventually, the symbols are translated into turtle graphics for plotting. Wikipedia has a very good introduction: en.wikipedia.org/wiki/L-system This package provides basic functions for exploring L-systems.

Version: 0.1-0
Depends: stringr, grid
Published: 2014-08-12
Author: Bryan Hanson [aut, cre]
Maintainer: Bryan Hanson <hanson at depauw.edu>
BugReports: https://github.com/bryanhanson/LindenmayeR/issues
License: GPL (≥ 3)
NeedsCompilation: no
Materials: NEWS
CRAN checks: LindenmayeR results

Downloads:

Reference manual: LindenmayeR.pdf
Package source: LindenmayeR_0.1-0.tar.gz
Windows binaries: r-devel: LindenmayeR_0.1-0.zip, r-release: LindenmayeR_0.1-0.zip, r-oldrel: LindenmayeR_0.1-0.zip
OS X Snow Leopard binaries: r-release: LindenmayeR_0.1-0.tgz, r-oldrel: LindenmayeR_0.1-0.tgz
OS X Mavericks binaries: r-release: LindenmayeR_0.1-0.tgz