A parallel algorithm for binary-tree-based string rewriting in L-systems

The L-system is a commonly used methodology to generate fractals and realistic model plants, yet it is very complex and computationally expensive. This paper presents a new parallel L-system string re-writing algorithm based on two types of binary tree: the growth-state tree (GST) and the growth-manner tree (GMT). This data structure makes one of the basic operations in the L-system - left and right context searching - extremely easy during the process of growth-state evolvement. Another benefit from this data structure is that we can make use of pseudo nodes to store information about neighboring sub-strings after each string partition. This helps working processes, in both the stage of growth and rendering, communicate well with each other so as to accomplish the final image compositions. Results of experimental tests have demonstrated that our parallel strategy works effectively on clusters with a multi-processors architecture.

[1]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[2]  M. Lanzagorta,et al.  Early Experience with Scientific Programs on the Cray MTA-2 , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[3]  A. Lindenmayer Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.

[4]  Jarek Nieplocha,et al.  ScalaBLAST: A Scalable Implementation of BLAST for High-Performance Data-Intensive Bioinformatics Analysis , 2006, IEEE Transactions on Parallel and Distributed Systems.

[5]  Pascal Müller,et al.  Procedural modeling of cities , 2001, SIGGRAPH.

[6]  David A. Bader,et al.  Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[7]  A. Lindenmayer Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs. , 1968, Journal of theoretical biology.

[8]  Radomír Mech,et al.  Visual models of plants interacting with their environment , 1996, SIGGRAPH.

[9]  Przemyslaw Prusinkiewicz,et al.  Parametric l-systems and their application to the modelling and visualization of plants , 1992 .

[10]  M. Mézard,et al.  Survey-propagation decimation through distributed local computations , 2005, cond-mat/0512002.

[11]  Thomas L. Madden,et al.  Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. , 1997, Nucleic acids research.

[12]  Radomír Mech,et al.  Realistic modeling and rendering of plant ecosystems , 1998, SIGGRAPH.

[13]  Daniel Singer Parallel Resolution of the Satisfiability Problem: A Survey , 2006 .

[14]  Mark James,et al.  Synthetic topiary , 1994, SIGGRAPH.