Reconstructing minimal length tree branch systems from leaf positions

Abstract : We present a method to infer a straight-lines tree branch system from a given set of leaf positions and average branching angles. Among an extensive set of possible branch systems constructed in the process, we choose the one featuring the shortest total length, following an optimality hypothesis by Leopold (1971). The approach is illustrated using empirical low-order skeletons from European beech. Our method further allows to assess, for a given species or individual tree, to what extent its branching pattern accords to Leopold's hypothesis, which we argue to be the case for beech. While yet facing issues of computational intensity for too many leaves, the method can furthermore be used to complement existing tree structure reconstruction methods that otherwise require a rudimentary skeleton as manual input.
Type de document :
Article dans une revue
Ecological Informatics, Elsevier, 2017, 42, pp.61 - 66. 〈10.1016/j.ecoinf.2017.09.010〉
Liste complète des métadonnées

https://hal-centralesupelec.archives-ouvertes.fr/hal-01630979
Contributeur : Paul-Henry Cournède <>
Soumis le : mercredi 8 novembre 2017 - 14:51:15
Dernière modification le : jeudi 5 avril 2018 - 12:30:26

Identifiants

Citation

Paul-Henry Cournède, Robert Beyer, Dominik Bayer, Hans Pretzsch. Reconstructing minimal length tree branch systems from leaf positions. Ecological Informatics, Elsevier, 2017, 42, pp.61 - 66. 〈10.1016/j.ecoinf.2017.09.010〉. 〈hal-01630979〉

Partager

Métriques

Consultations de la notice

86