3D tree modeling algorithm

Nowadays tree modeling algorithms are used in different fields of activity: from computer games to the plantation forest management. Tree modeling algorithm parameters can depend on different factors: it could be features of land- scape, climate or geographical location. Depending on the tasks to be solved, the detail level of the created model is chosen. Forest management tasks often do not require a high detail level, it is sufficient to construct a schematic plantation model. For computer games the creation of photorealistic models is required. The paper proposes an algorithm of 3D tree modeling which consists of the following steps: first step - building a tree framework (modeling the growth of a tree and adding new nodes), while under the framework is meant a set of three-dimensional vectors with attributive data for each vector; then building a tree and overlaying textures. The trunk and branches of the modeled tree are approximated by truncated cones, the axes of which are the vectors of the frame. The tree model constructing algorithm is iterative. Every iteration is a tree growth stage. Thus, the tree is gradually grown to the required level. The developed algorithm allows modeling trees of different state categories. The feature of the proposed algorithm is the possibility of constructing a three-dimensional tree model with any detail level. For example, for coniferous trees it is possible to built a tree up to each needle.