Three-Dimensional Simulation of Virtual Plants Branch Structure Based on Quasi Binary-Tree and L System
Ying Ying Yin
Abstract
Ying Ying Yin
Abstract
In order to simulate the plant branch structure in three-dimensional space, and extract the growth more efficiently, this paper presented a new method to simulate the structure of plant branch based on quasi binary-tree structure and three-dimensional L system. The results of the actual trees simulation shows that this method can describe the plants branch structure efficiently and provide a new way for the simulation of plants.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to simulate the plant branch structure in three-dimensional space, and extract the growth more efficiently, this paper presented a new method to simulate the structure of plant branch based on quasi binary-tree structure and three-dimensional L system. The results of the actual trees simulation shows that this method can describe the plants branch structure efficiently and provide a new way for the simulation of plants.
Key concepts: Binary tree, Tree (set theory), Tree structure, Binary number, Space (punctuation), Algorithm, Computer science, Data structure