Bosheng Li

dblp:311/7129 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
9since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-author · 7 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Woodstock: Interactive Modeling of Fungal Wood Decay
abstract
Fungal wood decay is a complex biophysical phenomenon that involves the degradation of a variety of structural wood components, ranging from lignin and carbohydrates to defensive chemical agents. All these substrates serve as varying resources with different material properties that determine the rate of fungal propagation and the structural integrity and color of decaying wood. We propose a novel approach to simulate the dynamic interactions between the biological and mechanical components of wood decay, including fungal colonization, chemical defense, and moisture-driven fracture. We propose a novel volumetric representation of trees that includes grain-aligned mesh generation, internal moisture dynamics, and tissue-specific health states. Furthermore, we model the anisotropic diffusion, consumption, and resulting material failure caused by white and brown rot fungi. This allows simulating and rendering 3D volumetric decaying trees that realistically capture key aspects of the process, such as the progression of cuboid fracture patterns, the hollowing of trunks, and the effects of environmental moisture on structural stability.
Zhanyu Yang, Nikolas Alexander Schwarz, Bosheng Li, Dominik L. Michels, Bedrich Benes, Sören Pirk, Wojtek Palubicki
ACM Trans. Graph.3
2025 TreeStructor: Forest Reconstruction With Neural Ranking
abstract
We introduceTreeStructor, a novel approach for isolating and reconstructing forest trees. The key novelty is a deep neural model that uses neural ranking to assign pre-generated connectable 3D geometries to a point cloud.TreeStructoris trained on a large set of synthetically generated point clouds. The input to our method is a forest point cloud (FPC) that we first decompose into point clouds that approximately represent trees (TPC) and then into point clouds that represent their parts (PPC). We use a point cloud encoder-decoder to compute embedding vectors that retrieve the best-fitting surface mesh for eachPPCfrom a large set of predefined branch parts. Finally, the retrieved meshes are connected and oriented to obtain individual surface meshes of all trees represented by theFPC. We qualitatively and quantitatively validate that our method can reconstruct forest trees with unprecedented accuracy and visual fidelity.TreeStructoroutperforms the state-of-the-art reconstruction method for around 6% on quantitative metrics and 12% less error compared with QSM on low-quality scanned data. The code and data are available at https://lewkesy.github.io/TreeStructor/.
Xiaochen Zhou, Bosheng Li, Bedrich Benes, Ayman Habib 0001, Songlin Fei, Jinyuan Shao, Sören Pirk
IEEE Trans. Geosci. Remote. Sens.2
2025 Errata to "TreeStructor: Forest Reconstruction With Neural Ranking"
abstract
Presents corrections to the paper, (Errata to “TreeStructor: Forest Reconstruction With Neural Ranking”).
Xiaochen Zhou, Bosheng Li, Bedrich Benes, Ayman Habib 0001, Songlin Fei, Jinyuan Shao, Sören Pirk
IEEE Trans. Geosci. Remote. Sens.2
2024 Tree-D Fusion: Simulation-Ready Tree Dataset from Single Images with Diffusion Priors
Jae Joong Lee, Bosheng Li, Sara Beery, Jonathan Huang, Songlin Fei, Raymond A. Yeh, Bedrich Benes
ECCV (41)2
2024 Latent L-systems: Transformer-based Tree Generator
abstract
We show how a Transformer can encode hierarchical tree-like string structures by introducing a new deep learning-based framework for generating 3D biological tree models represented as Lindenmayer system (L-system) strings. L-systems are string-rewriting procedural systems that encode tree topology and geometry. L-systems are efficient, but creating the production rules is one of the most critical problems precluding their usage in practice. We substitute the procedural rules creation with a deep neural model. Instead of writing the rules, we train a deep neural model that produces the output strings. We train our model on 155k tree geometries that are encoded as L-strings, de-parameterized, and converted to a hierarchy of linear sequences corresponding to branches. An end-to-end deep learning model with an attention mechanism then learns the distributions of geometric operations and branches from the input, effectively replacing the L-system rewriting rule generation. The trained deep model generates new L-strings representing 3D tree models in the same way L-systems do by providing the starting string. Our model allows for the generation of a wide variety of new trees, and the deep model agrees with the input by 93.7% in branching angles, 97.2% in branch lengths, and 92.3% in an extracted list of geometric features. We also validate the generated trees using perceptual metrics showing 97% agreement with input geometric models.
Jae Joong Lee, Bosheng Li, Bedrich Benes
ACM Trans. Graph.2
2024 Interactive Invigoration: Volumetric Modeling of Trees with Strands
abstract
Generating realistic models of trees and plants is a complex problem because of the vast variety of shapes trees can form. Procedural modeling algorithms are popular for defining branching structures and steadily increasing their expressive power by considering more biological findings. Most existing methods focus on defining the branching structure of trees based on skeletal graphs, while the surface mesh of branches is most commonly defined as simple cylinders. One critical open problem is defining and controlling the complex details observed in real trees. This paper aims to advance tree modeling by proposing a strand-based volumetric representation for tree models. Strands are fixed-size volumetric pipes that define the branching structure. By leveraging strands, our approach captures the lateral development of trees. We combine the strands with a novel branch development formulation that allows us to locally inject vigor and reshape the tree model. Moreover, we define a set of editing operators for tree primary and lateral development that enables users to interactively generate complex tree models with unprecedented detail with minimal effort.
Bosheng Li, Nikolas Alexander Schwarz, Wojtek Palubicki, Sören Pirk, Bedrich Benes
ACM Trans. Graph.1
2024 DeepTree: Modeling Trees With Situated Latents
abstract
In this article, we propose DeepTree, a novel method for modeling trees based on learning developmental rules for branching structures instead of manually defining them. We call our deep neural model "situated latent" because its behavior is determined by the intrinsic state -encoded as a latent space of a deep neural model- and by the extrinsic (environmental) data that is "situated" as the location in the 3D space and on the tree structure. We use a neural network pipeline to train a situated latent space that allows us to locally predict branch growth only based on a single node in the branch graph of a tree model. We use this representation to progressively develop new branch nodes, thereby mimicking the growth process of trees. Starting from a root node, a tree is generated by iteratively querying the neural network on the newly added nodes resulting in the branching structure of the whole tree. Our method enables generating a wide variety of tree shapes without the need to define intricate parameters that control their growth and behavior. Furthermore, we show that the situated latents can also be used to encode the environmental response of tree models, e.g., when trees grow next to obstacles. We validate the effectiveness of our method by measuring the similarity of our tree models and by procedurally generated ones based on a number of established metrics for tree form.
Xiaochen Zhou, Bosheng Li, Bedrich Benes, Songlin Fei, Sören Pirk
IEEE Trans. Vis. Comput. Graph.2
2023 Rhizomorph: The Coordinated Function of Shoots and Roots
abstract
Computer graphics has dedicated a considerable amount of effort to generating realistic models of trees and plants. Many existing methods leverage procedural modeling algorithms - that often consider biological findings - to generate branching structures of individual trees. While the realism of tree models generated by these algorithms steadily increases, most approaches neglect to model the root system of trees. However, the root system not only adds to the visual realism of tree models but also plays an important role in the development of trees. In this paper, we advance tree modeling in the following ways: First, we define a physically-plausible soil model to simulate resource gradients, such as water and nutrients. Second, we propose a novel developmental procedural model for tree roots that enables us to emergently develop root systems that adapt to various soil types. Third, we define long-distance signaling to coordinate the development of shoots and roots. We show that our advanced procedural model of tree development enables - for the first time - the generation of trees with their root systems.
Bosheng Li, Jonathan Klein, Dominik L. Michels, Bedrich Benes, Sören Pirk, Wojtek Palubicki
ACM Trans. Graph.1
2021 Learning to reconstruct botanical trees from single images
abstract
We introduce a novel method for reconstructing the 3D geometry of botanical trees from single photographs. Faithfully reconstructing a tree from single-view sensor data is a challenging and open problem because many possible 3D trees exist that fit the tree's shape observed from a single view. We address this challenge by defining a reconstruction pipeline based on three neural networks. The networks simultaneously mask out trees in input photographs, identify a tree's species, and obtain its 3D radial bounding volume - our novel 3D representation for botanical trees. Radial bounding volumes (RBV) are used to orchestrate a procedural model primed on learned parameters to grow a tree that matches the main branching structure and the overall shape of the captured tree. While the RBV allows us to faithfully reconstruct the main branching structure, we use the procedural model's morphological constraints to generate realistic branching for the tree crown. This constraints the number of solutions of tree models for a given photograph of a tree. We show that our method reconstructs various tree species even when the trees are captured in front of complex backgrounds. Moreover, although our neural networks have been trained on synthetic data with data augmentation, we show that our pipeline performs well for real tree photographs. We evaluate the reconstructed geometries with several metrics, including leaf area index and maximum radial tree distances.
Bosheng Li, Jacek Kaluzny, Jonathan Klein, Dominik L. Michels, Wojtek Palubicki, Bedrich Benes, Sören Pirk
ACM Trans. Graph.1