Parallel Generation of L-Systems

Markus Lipp, Peter Wonka, Michael Wimmer
Parallel Generation of L-Systems
In Vision, Modeling, and Visualization Workshop (VMV) 2009 , pages 205-214. November 2009.
[ paper]
Content:

Information

Abstract

This paper introduces a solution to compute L-systems on parallel architectures like GPUs and multi-core CPUs. Our solution can split the derivation of the L-system as well as the interpretation and geometry generation into thousands of threads running in parallel. We introduce a highly parallel algorithm for L-system evaluation that works on arbitrary L-systems, including parametric productions, context sensitive productions, stochastic production selection, and productions with side effects. Further we directly interpret the productions defined in plain-text, without requiring any compilation or transformation step (e.g., into shaders). Our algorithm is efficient in the sense that it requires no explicit inter-thread communication or atomic operations, and is thus completely lock free.

Additional Files and Images

Additional files:
paper
paper




BibTeX

Download BibTeX-Entry
@inproceedings{LIPP-2009-PGL,
  title =      "Parallel Generation of L-Systems",
  author =     "Markus Lipp and Peter Wonka and Michael Wimmer",
  year =       "2009",
  abstract =   "This paper introduces a solution to compute L-systems on
               parallel architectures like GPUs and multi-core CPUs. Our
               solution can split the derivation of the L-system as well as
               the interpretation and geometry generation into thousands of
               threads running in parallel. We introduce a highly parallel
               algorithm for L-system evaluation that works on arbitrary
               L-systems, including parametric productions, context
               sensitive productions, stochastic production selection, and
               productions with side effects. Further we directly interpret
               the productions defined in plain-text, without requiring any
               compilation or transformation step (e.g., into shaders). Our
               algorithm is efficient in the sense that it requires no
               explicit inter-thread communication or atomic operations,
               and is thus completely lock free.",
  pages =      "205--214",
  month =      nov,
  booktitle =  "Vision, Modeling, and Visualization Workshop (VMV) 2009 ",
  editor =     "Marcus Magnor, Bodo Rosenhahn, Holger Theisel",
  isbn =       "978-3980487481",
  location =   "Braunschweig",
  URL =        "http://www.cg.tuwien.ac.at/research/publications/2009/LIPP-2009-PGL/",
}