Reconstructing minimal length tree branch systems from leaf positions - Archive ouverte HAL Access content directly
Journal Articles Ecological Informatics Year : 2017

Reconstructing minimal length tree branch systems from leaf positions

(1) , (1) , , (2)
1
2

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.
Not file

Dates and versions

hal-01630979 , version 1 (08-11-2017)

Identifiers

Cite

Paul-Henry P.-H. Cournède, Robert Beyer, Dominik Bayer, Hans Pretzsch. Reconstructing minimal length tree branch systems from leaf positions. Ecological Informatics, 2017, 42, pp.61 - 66. ⟨10.1016/j.ecoinf.2017.09.010⟩. ⟨hal-01630979⟩
172 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More