I am trying to create an algorithm which would be able to - somewhat accurately - create a tree by modelising it as verteces which split and create more branches and i have been wondering if there was a known mathematical relationship between the length of for example the last segment at the very end of the whole branche (rank one) and the segment it originated from (rank 2) etc and a general expression for nth rank segment.
Although i realize this will surely vary depending on which tree species we are talking about, but if anyone knows anything regarding this subject I would be very interested, the goal her being to create something resembling a fruit tree like an apple tree for example.
For now in this 2D model (before upgrading to 3D), I have implemented a length of nth rank segment= n relation.
for now i know the shape doesnt quite ressemble the kind of tree im looking for but I will change that later.