- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces GRAVER, an image-conditioned 3D generation framework that directly produces fine geometry in an explicit sparse voxel representation (block-UDF). The method factorizes generation into three stages: global block layout on a 64³ grid, local surface-support masks (8³ per block) via a sparse occupancy VAE, and fine unsigned distance values (16³ per block) through support-conditioned flow matching without a geometry autoencoder. The spatially indexed representation further enables native 3D editing with hard preservation of unedited regions. Experiments show semantic alignment competitive with TRELLIS2 and Hunyuan3D 2.1, and editing results demonstrate strong fixed-region fidelity.
Critical strengths
- Clean hierarchical decomposition that concentrates computation near surfaces. The three-stage factorization (where → support → geometry) is well-motivated: Stage 1 eliminates empty space, Stage 2 localizes the surface neighborhood, and Stage 3 only generates UDF values where the gate is active. This avoids the infeasible cost of dense 960³ generation while keeping the final generative state in explicit geometric variables. The ablation in Table 2(c) confirms that the support mask is critical — removing it degrades by nearly 4×.
- Native editing with hard preservation guarantees. Because the representation is spatially indexed, unedited regions are preserved by direct value copying rather than a soft consistency loss. This is a structural advantage over latent-space editing methods where preservation can only be encouraged, not enforced. Table 3 validates this: Fix@100 achieves 99.998% F-score on model-generated assets, demonstrating near-lossless round-tripping.
Critical weaknesses
-
Insufficient experimental evidence to support the central claim. The paper's core argument is that direct UDF generation in explicit sparse space yields better geometry than latent-decoded alternatives. However, Table 1 reports only semantic alignment metrics (CLIP-N, ULIP-2, Uni3D) and an LLM quality rating — standard geometric accuracy metrics (Chamfer Distance, F-score, IoU, Hausdorff Distance) against ground-truth meshes are entirely absent. Moreover, GRAVER does not significantly outperform any baseline on the reported metrics: TRELLIS2 leads on CLIP-N and Quality-LLM, TRELLIS leads on ULIP-2, and GRAVER's only first-place result (Uni3D: 0.3568 vs 0.3538) falls within one standard deviation. For a new representation and generation paradigm, parity on proxy metrics without demonstrated geometric superiority is insufficient to justify the added complexity of a three-stage pipeline.
-
Resolution comparison is unspecified and scalability is unclear. The paper does not state at what resolution the baseline methods produce their meshes for evaluation. For instance, TRELLIS2 is capable of generating at 1536³ resolution, which is substantially higher than GRAVER's effective 960³. It remains unclear whether GRAVER's advantage (if any) persists at matched or higher resolutions, whether the block-UDF hierarchy can scale beyond 960³, and what the corresponding VRAM cost would be. Without this information, the comparison may not be conducted on equal footing.
Questions for authors
-
Can you report geometric accuracy metrics (Chamfer Distance, F-score, IoU) against ground-truth meshes for the baseline comparison in Table 1? Without these, it is unclear whether direct UDF generation yields more faithful geometry than latent-decoded approaches.
-
What is the inference time and peak memory usage of the full three-stage pipeline, compared to TRELLIS2 and Hunyuan3D 2.1? Given the 960³ effective resolution and 20-layer sparse transformer in Stage 3, computational cost is a practical concern.
-
Stage 1 and Stage 2 both rely heavily on pretrained TRELLIS2 components (sparse-structure VAE, occupancy VAE, flow model). Could you clarify what proportion of the total system is newly trained versus inherited? Would the method still work if these components were trained from scratch on your data?