Skip to Main content Skip to Navigation
Conference papers

Fast Algorithms of Plant Computation Based on Substructure Instances

Hongping Yan 1 Barczi Jean François 2 Philippe de Reffye 2 Baogang Hu 1 Marc Jaeger 2 Jonathan Leroux 2 
2 DIGIPLANTE - Modélisation de la croissance et de l'architecture des plantes
MAS - Mathématiques Appliquées aux Systèmes - EA 4037, Cirad - Centre de Coopération Internationale en Recherche Agronomique pour le Développement, Inria Saclay - Ile de France
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Chine Publications Liama Connect in order to contact the contributor
Submitted on : Tuesday, January 2, 2007 - 3:46:48 PM
Last modification on : Friday, February 4, 2022 - 3:24:02 AM


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



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⟩



Record views