Název: Fast algorithm for stochastic tree computation
Autoři: Kang, MengZheng
Reffye, Philippe de
Barczi, Jean-François
Hu, Bao Gang
Citace zdrojového dokumentu: WSCG '2003: Posters: The 11-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2003, 3.-7. February 2003, Plzen, p. 65-68.
Datum vydání: 2003
Nakladatel: UNION Agency
Typ dokumentu: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2003/Papers_2003/I73.pdf
ISBN: 80-903100-2-8
Klíčová slova: rychlé algoritmy;3D simulace;růst stromu
Klíčová slova v dalším jazyce: fast algorithms;3D simulation;tree growth
Abstrakt: In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ‘macrostate’ and ‘microstate’ are used to simulate the growth unit and the metamers inside growth unit separately. Each state is characterized by its ‘physiological age’. The automaton is non-deterministic in case that the probabilities exist in each growth cycle simulating the bud activity. Since the main plant structure and branches are statistically similar, and each structure can be decomposed into an axis and substructures, simulation is begun from smallest structures that have no further branch, and that information are used when such kind of structures appear in other branches. To keep the diversity of tree structure, several stochastic structures will be simulated at one time for a given physiological and chronological age. This algorithm can save a lot of time compared to node-by-node simulation. Verification is done both in organ number counting and visualization.
Práva: © UNION Agency
Vyskytuje se v kolekcích:WSCG '2003: Posters

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
I73a.pdf290,59 kBAdobe PDFZobrazit/otevřít

Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/1022

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.