Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yan, Hong-Ping | |
dc.contributor.author | Barczi, Jean Francois | |
dc.contributor.author | De Reffye, Phillipe | |
dc.contributor.author | Hu, Bao-Gang | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2013-07-26T06:24:10Z | - |
dc.date.available | 2013-07-26T06:24:10Z | - |
dc.date.issued | 2002 | |
dc.identifier.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. | en |
dc.identifier.isbn | 1213-6972 (hardcopy) | |
dc.identifier.isbn | 1213-6980 (CD-ROM) | |
dc.identifier.isbn | 1213-6964 (on-line) | |
dc.identifier.uri | http://wscg.zcu.cz/wscg2002/Papers_2002/F37.pdf | |
dc.identifier.uri | http://hdl.handle.net/11025/6048 | |
dc.description.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. | en |
dc.format | 8 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | UNION Agency | en |
dc.relation.ispartofseries | WSCG '2002: Short Communication Papers | en |
dc.rights | © UNION Agency | cs |
dc.subject | rychlé algoritmy | cs |
dc.subject | substruktury | cs |
dc.subject | rostliny | cs |
dc.title | Fast algorithms of plant computation based on substructure instances | en |
dc.type | konferenční příspěvek | cs |
dc.type | conferenceObject | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.subject.translated | fast algorithms | en |
dc.subject.translated | substructure | en |
dc.subject.translated | plants | en |
dc.type.status | Peer-reviewed | en |
Appears in Collections: | WSCG '2002: Short Communication Papers |
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.