Title: Fast algorithms of plant computation based on substructure instances
Authors: Yan, Hong-Ping
Barczi, Jean Francois
De Reffye, Phillipe
Hu, Bao-Gang
Citation: WSCG '2002: Short Communication Papers: The 10-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2002, 4.-8. February 2002 Plzeň: Conference proceedings, p. 145-152.
Issue Date: 2002
Publisher: UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2002/Papers_2002/F37.pdf
ISBN: 1213-6972 (hardcopy)
1213-6980 (CD-ROM)
1213-6964 (on-line)
Keywords: rychlé algoritmy;substruktury;rostliny
Keywords in different language: fast algorithms;substructure;plants
Abstract: Fast rendering and botanically faithful description of plants are a real challenge in computer graphics. Usually, plant production is computed using the method internode by internode, while there exist a lot of buds in an individual tree, therefore, this approach is quite time-consuming even for a medium-size tree. In this paper, we present a new algorithm based on substructure instances to quickly compute plants’ production, and then, for certain plant architectural models, combine with the geometrical rules to create a substructure library. Finally, we construct 3D virtual plants using 3D organs. Compared with the classical method in computing and constructing plant structures, the algorithm described in this paper is much faster while keeping botanical nature of plant. The algorithm can be generalized to most plant species.
Rights: © UNION Agency
Appears in Collections:WSCG '2002: Short Communication Papers

Files in This Item:
File Description SizeFormat 
F37.pdfPlný text158,43 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6048

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.