- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This work introduces a text-conditioned for a target tree species, 3D tree generation method using a diffusion method. Especially, the generation method consists of three multiple stages, from CLIP text Encoder, Scaffold Tree representation, and residual allocation to get the final output shape. It uses TreeNet3D as a main dataset with nine tree species. From this evalaution, this method shows the best scores in coverage, structural agreement, local-curve matching and branch collisions.
Critical strengths
- Tree Species Condition 3D generation.
- Well designed tree specific representation, especially branch geometry representation to get the global and local branch information instead of having one unified information.
- Five metrics are used to evaluate the quality of generated trees.
Critical weaknesses
- There is prior work that is very similar, including text-to-species condition with 3D Tree generation with Diffusion models, but this paper did not introduce this work and did not make any comparison. Tree-D Fusion (Lee et al, ECCV 2024).
- The evaluation method is hard to understand. Authors mention “we generate 200 trees per species and evaluate them on the test split”, but if this is a generation task, what does it mean “test split”? Trees are complex, so I wonder if 200 test cases were enough. 200 might small and the evaluation should be larger.
- There are no reports on how long it takes and what the peak VRAM is for generating one tree.
- Since, this is a tree-specific generation method. It will be better to include tree-specific metrics such as DBH, branching angles, the number of twigs or the number of branches.
Questions for authors
- Why Tree-D fusion is not discussed in the related work and why not compared with this paper since it is a direct comparable baseline.
- How authors get L-strings from TreeNet3D dataset? Since Latent L-system method needs L-strings, I wonder about the quality of the training data in L-strings.
4 comments
I appreciate the authors. But my concerns are not fully resolved because of missing related work that is very closely related and the specific scores for the tree.
Comment 1: Tree-d fusion needs the image and the tree species in the text, which is also the species condition this method use. I do not think missing the closely related work is a good thing.
Comment 4: Thank you for adding these tree-specific scores, but I do not understand how they are good or how they are aligned.
Comment 1: Tree-d fusion needs the image and the tree species in the text, which is also the species condition this method use. I do not think missing the closely related work is a good thing.
Answer: (Section 2) Thank you for taking the time to revisit our response and clarify this point. Tree-D Fusion is closely related to our work, particularly in combining diffusion models with text-based tree-category conditioning. Our earlier response emphasized the difference in input requirements without sufficiently explaining this important connection. We appreciate your clarification and have revised Section 2 accordingly. The discussion now explicitly recognizes the shared use of diffusion models and tree-category text conditioning, before explaining the methodological differences: Tree-D Fusion uses diffusion priors to reconstruct a tree envelope and then constructs branches through genus-conditioned space colonization, whereas ScaffoldTree directly learns branch geometry and parent topology through scaffold diffusion, branch allocation, and local residual diffusion. Our contribution lies in directly generating explicit branching structures, including branch curves and parent–child topology, through a learned scaffold-to-subtree factorization, rather than species conditioning alone. A direct quantitative comparison would need to account for the additional reference image required by Tree-D Fusion. We have made these connections and distinctions explicit and given the work a fuller discussion in the revised Related Work section.
Comment 4: Thank you for adding these tree-specific scores, but I do not understand how they are good or how they are aligned.
Answer: (Section 4.3, Appendix A.5) Thank you for asking us to clarify the interpretation. The Table 2 reports distribution-matching errors, not raw branch counts or angles. For each species, we compare statistics from 200 generated trees with the same 30 held-out reference trees using normalized Wasserstein-1 distance. Lower values indicate closer agreement with the reference distribution; zero denotes identical empirical distributions of the measured statistic. The normalization scale is computed only from the reference data and shared by all methods, and scores are averaged equally over nine species. No generated tree or branch is paired with a particular reference: comparison is between same-species distributions. These statistics also do not require spatial registration, since counts, ratios, and relative branching angles are invariant to translation, rotation, and uniform scaling. Branch count measures overall branching complexity; branching angle describes local parent-child geometry; terminal count and ratio measure the number and proportion of childless branches. Thus, a lower score means better matching of these properties, not that fewer branches or smaller angles are intrinsically better. ScaffoldTree has the lowest terminal-count and terminal-ratio errors (0.4573 and 0.3640) and ranks second on branch count and angle, supporting its stronger matching of terminal-branch structure alongside competitive global complexity and local geometry. We have clarified the interpretation in the “Tree-specific evaluation” paragraph in Section 4.3 and the Table 2 caption, and provided the calculation details in the Appendix A.5.
Dear Reviewer BwVr,
We are still awaiting your response to our revised manuscript and point-by-point rebuttal.
Following your additional comments, we expanded Section 2 to discuss the close relationship between Tree-D Fusion and ScaffoldTree, and clarified the interpretation and comparison procedure for the tree-specific metrics in Section 4.3, Table 2, and Appendix A.5. Our response identifies the corresponding changes.
We would appreciate your assessment of whether these revisions address your remaining concerns. If further issues remain, your feedback would give us an opportunity to clarify them during the discussion and help ensure that the final assessment considers the revised manuscript and additional evidence.
Thank you for your time.
Comment 1: There is prior work that is very similar, including text-to-species condition with 3D Tree generation with Diffusion models, but this paper did not introduce this work and did not make any comparison. Tree-D Fusion (Lee et al, ECCV 2024).
Answer: (Section 2) Thank you for the suggestion. We have expanded Section 2, “Related Work,” to discuss Tree-D Fusion (Lee et al., ECCV 2024) and its relationship to ScaffoldTree. Although both methods involve diffusion models and tree-category conditioning, they address different tasks. Tree-D Fusion requires a reference image and a genus label to reconstruct a 3D tree, whereas ScaffoldTree generates 3D branching structures directly from species conditions without requiring reference images. The former therefore addresses image-guided reconstruction, while the latter targets species-conditioned generation. The reference image is an essential input to Tree-D Fusion’s task, rather than an optional condition that can simply be removed. This difference in task formulation makes a direct quantitative comparison under identical input conditions and evaluation protocols difficult.
Comment 2: The evaluation method is hard to understand. Authors mention “we generate 200 trees per species and evaluate them on the test split”, but if this is a generation task, what does it mean “test split”? Trees are complex, I wonder if 200 test cases were enough. 200 might small and the evaluation should be larger.
Answer: (Section 4.1, Appendix A.12) The test split contains 270 held-out real trees (30 per species), used as a reference distribution, not paired reconstruction targets or generator inputs. We clarify this in Section 4.1, “Evaluation protocol.” We expanded ScaffoldTree and both external baselines from 200 to 400 generated trees per species (1,800 to 3,600 per method). Expanded sets retain the original samples; checkpoints, inference settings, and references are unchanged. The macro-averaged rankings remain unchanged across all six metrics, supporting stable conclusions when the generation budget is doubled. ScaffoldTree maintains higher Coverage and lower Struct. W1-ND, Curve W1, and collision rates, while DivineTree-9x maintains lower Fidelity and MMD. Appendix A.12 reports the full 200/400 comparison.
Comment 3: There are no reports on how long it takes and what the peak VRAM is for generating one tree.
Answer: (Section 4.1) On an NVIDIA RTX 5090, ScaffoldTree takes an average of 8.73 seconds to generate one tree, with observed peak GPU memory of 4.18 GiB. We clarify this in Section 4.1, “Dataset and Implementation.”
Comment 4: Since, this is a tree-specific generation method. It will be better to include tree-specific metrics such as DBH, branching angles, the number of twigs or the number of branches.
Answer: (Section 4.3) We added tree-specific metrics in Section 4.3, “Quantitative Analysis.” Branch count is the total number of branches, including the root; branching angle is measured between a child’s initial segment and the parent tangent at attachment; terminal count is the number of childless branches; terminal ratio divides this count by the total branch count. We compare generated and reference distributions using the same samples and normalized Wasserstein-1 distances, macro-averaged over nine species. ScaffoldTree best matches terminal-branch abundance and proportion, with the lowest terminal-count and terminal-ratio errors and second-best branch-count and angle errors. DBH would be a useful complementary measure. However, it requires physical-scale and radius information not shared by all methods; Latent L-Systems does not predict radii. We therefore evaluate centerline geometry and topology shared by all methods.
Comment 5: How authors get L-strings from TreeNet3D dataset? Since Latent L-system method needs L-strings, I wonder about the quality of the training data in L-strings.
Answer: (Section 4.1, Appendix A.6) Our adapter converts processed TreeNet3D centerlines and parent–child connections into L-strings. Each centerline is encoded segment by segment as yaw, pitch, and forward-step commands, with bracketed child-rule references at discretized attachment positions. We use the released Latent L-Systems architecture and fixed-bin quantization in our adapter. All 11,847 training trees were successfully converted. Encoding and reconstructing all 270 held-out trees preserves branch counts and parent–child connections for all 30 trees in each of the nine species (Appendix A.6, per-species table). Mean paired symmetric squared Chamfer distances are 0.007873 and 0.006006 at 128 and 512 points, respectively, measured in root-aligned, unit-height coordinates without additional rotation or scale fitting. These checks support the conversion as an effective way to construct structurally consistent L-string training targets, with geometric approximation explicitly quantified. Section 4.1 describes the adapter; Appendix A.6 details conversion and validation.