Computational Algorithm for Some Problems with Variable Geometrical Structure
The work is devoted to the computational algorithm for a problem of plant growth. The plant is represented as a system of connected intervals corresponding to branches. We compute the concentration distributions inside the branches. The originality of the problem is that the geometry of the plant is not a priori given. It evolves in time depending on the concentrations of plant hormones found as a solution of the problem. New branches appear in the process of plant growth. The algorithm is adapted to an arbitrary plant structure and an arbitrary number of branches.
KeywordsPlants branching variable structure computational algorithm
Unable to display preview. Download preview PDF.
- 1.Krug, H., Liebig, H.-P.: International Symposium on Models for Plant Growth, Environmental Control and Farm Management in Protected Cultivation. ISHS Acta Horticulturae, vol. 248 (1989)Google Scholar
- 2.Godin, C., et al.: 4th International Workshop on Functional-Structural Plant Models. Publication UMR AMAP (2004)Google Scholar
- 3.Bessonov, N., Volpert, V.: Dynamic Models of Plant Growth. Publibook, Paris (2006)Google Scholar
- 14.Vernoux, T., Kronenberger, J., Grandjean, O., Laufs, P., Traas, J.: PIN-FORMED 1 Regulates Cell Fate at the Periphery of the Shoot Apical Meristem. Development 127, 5157–5165 (2000)Google Scholar
- 16.Aida, M., Vernoux, T., Furutani, M., Traas, J., Tasaka, M.: Roles of PIN-FORMED1 and MONOPTEROS in Pattern Formation of the Apical Region of the Arabidopsis Embryo. Development 129, 3965–3974 (2002)Google Scholar