Fast Algorithms of Plant Computation Based on Substructure Instances - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Fast Algorithms of Plant Computation Based on Substructure Instances

Abstract

Green plants' fast rendering and faithful description are a real challenge in computer graphics. How can we faithfully mo del and high efficiently compute green plants' production according to botanical knowledge to adapt to the increasing demand of scientific research, education and business. In this paper, we present a new algorithm to quickly compute the plants' production, and then, for certain plant architectural models, combine with the geometrical rules to create 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 accurate shape. The algorithm can be generalized to most plant species.
No file

Dates and versions

inria-00122493 , version 1 (02-01-2007)

Identifiers

  • HAL Id : inria-00122493 , version 1
  • PRODINRA : 252077

Cite

Hongping Yan, Barczi Jean François, Philippe de Reffye, Baogang Hu, Marc Jaeger, et al.. Fast Algorithms of Plant Computation Based on Substructure Instances. International Conferences in Central Europe on Computer Graphics, Visualization and Computer Vision, 2002, Bory / Czech Republic, Czech Republic. pp.145-153. ⟨inria-00122493⟩
240 View
0 Download

Share

Gmail Facebook X LinkedIn More