%0 Conference Proceedings
%@isbn 978-85-7669-272-0
%T A depth first search strategy for L-systems’ turtle interpretation
%D 1994
%A Oliveira Neto, Manuel Menezes de,
%A Benvenuti, Vítor César,
%@affiliation Fundação Universidade Federal de Blumenau (FURB)
%@affiliation Fundação Universidade Federal de Blumenau (FURB)
%E Freitas, Carla dal Sasso,
%E Geus, Klaus de,
%E Scheer, Sérgio,
%B Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, 7 (SIBGRAPI)
%C Curitiba
%8 9 - 11 nov. 1994
%I Sociedade Brasileira de Computação
%J Porto Alegre
%V 1
%P 101-108
%S Anais
%K L-systems, trees modeling, plants modeling, recursive interpretation algorithm.
%X L-systems have become one of the most popular approaches for plants and trees modeling. Although they have been widely explored by many researches, they are almost always treated at grammar-level, while few attentions have been given to implementation issues. The only known published algorithmic description for L-systems turtle interpretation is based on a two steps assembly and interpretation process over a string. This paper proposes a recursive more natural interpretation algorithm that operates in parallel to the process of translation of grammars symbols, benefiting from its recursive nature. The proposed algorithm dispenses the traditional string assembly. It also has proved to be faster and more robust than the string-based one.
%9 Modelagem e Animação
%@language en
%3 14 A depth first search strategy.pdf