- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper represents 3D surfaces as the zero level set of the difference between two maxima of affine functions and extracts interfaces between oppositely labeled cells in a power diagram. The fitting algorithm includes geometric initialization, normal-guided discrete matching, assignment stabilization, and pruning. Experiments demonstrate competitive reconstruction quality compared with the baseline.
Critical strengths
Defining surfaces through interfaces between positively and negatively labeled power cells is an interesting implicit–explicit formulation that accommodates complex topology. The optimization challenges are generally well explained, and the proposed solutoin are reasonably motivated.
The main fitting experiments demonstrate strong quantitative and qualitative results, with better reconstruction accuracy and substantially fewer parameters than the evaluated baselines.
Critical weaknesses
The method would be easier to follow with preliminaries connecting Voronoi diagrams, power distances, and affine-function maxima. Figures 3–4 would benefit from labeled sites/cells and numbered stages illustrating surface interfaces, candidate selection, and the effect of matching.
The “without DM” baseline in table 4 also changes smoothing, off-surface regularization, and initialization. Its poorer performance therefore cannot be attributed specifically to removing matching. A controlled ablation should be required.
The current fitting pipeline is limited to closed manifold surfaces and struggles with 3D shape with non manifold structure, open surface and self-intersection, which is widely presented in large 3D shape dataset like Objaverse. Preprocessing algorithm would cause loss of geometry.
The mean Chamfer improvement highlighted in Section 4.2 averages only the seven winning cases, rather than all ten evaluated shapes. ICLR_paper3 Averaging all ten entries in Table 9 (Appendix G.3, p. 24) yields approximately 8.898 × 10⁻³ for Patchwork (5M initialization), versus 3.805 × 10⁻³ for GeomDist. Presenting the favorable subset average without corresponding full-set statistics can be misleading.
The complex-asset scalability study evaluates only ten shapes, which provides limited evidence of robustness across diverse, high-detail geometry. Moreover, the experiments optimize each shape independently rather than train a shared encoder–decoder across a dataset. So it is not sure whether the proposed method could be used to train generative model.
Questions for authors
Can you provide a controlled ablation/intuitive explanation on how the result would be that replaces normal-guided matching with ordinary top-1 assignment while keeping the hard-max formulation, initialization, losses, pruning, and training budget unchanged, to isolate the contribution of matching itself?
3 comments
Follow-up on rebuttal
Thank you again for your thoughtful and positive review. As the discussion period draws to a close, we wanted to briefly follow up and highlight the main points of our rebuttal:
- Discrete Matching (DM) ablation (W2 / Q1): The newly isolated ablation shows that DM substantially improves fitting quality; without it, the results degrade to low-polygon approximations.
- Additional revisions (W1, W3, W4): We have added background on Voronoi/power diagrams, power distance, and max-affine functions; improved the figure annotations; clarified the manifold assumption; and explained the reported GeomDist metrics.
In our response, we have also discussed the method’s generative potential (W5). We would appreciate knowing whether our responses have addressed the concerns raised in your initial review, and we are happy to clarify anything that remains unresolved.
Looking for Reviewer's reply !!!
Dear Reviewer 3H5u,
Thank you for providing your valuable review comments on this manuscript.
Do the authors’ responses address all of your questions?
We look forward to hearing from you.
Best Regards.
Author Response
We thank the reviewer for the positive, constructive feedback. In the revised manuscript, we have added preliminary background on Voronoi and power diagrams, power distance, and the maxima of affine functions (new Fig. 4). We have also added annotations to Figures 3 and 5 (previous Fig. 4) to improve clarity (W1).
W2 / Q1. Without discrete matching (DM) ablation. To isolate DM, we kept all configurations and the training budget unchanged, modifying only the top-1 assignment. Without DM, the optimization converges to a low-polygonal approximation, resulting in a substantially lower F-Score and greatly diminished detail (See revised Fig. 2).
& CH \downarrow & HS \downarrow & FS \uparrow & NC \uparrow & IoU \uparrow \\\\ \hline \text{w.o. DM} & 3.74 / 4.17 & 5.77 / 9.32 & 37.78 / 31.85 & 94.90 / 94.49 & 92.24 / 94.34 \\\\ \text{Full} & \textbf{1.90} / \textbf{1.80} & \textbf{3.81} / \textbf{6.78} & \textbf{73.22} / \textbf{77.27} & \textbf{98.05} / \textbf{98.17} & \textbf{98.39} / \textbf{99.14} \end{array}$$ We have replaced the DM in Tab. 4 with the new results and renamed the previous smooth variant ablation to “Hard Maximum (HM)”. **W3. Closed manifold surface assumption**. We fully agree with the reviewer’s assessment regarding our closed-manifold assumption, and acknowledge that preprocessing comes at the cost of some geometric fidelity. This is precisely why we kept the shape datasets unprocessed wherever possible (ABC, Thingi10K, Roof Modeling, and GeomDist), preprocessing only when necessary (ShapeNet). Although large-scale datasets such as Objaverse exhibit far more diverse topology, converting shapes to manifolds remains a standard and well-established practice in 3D shape learning and generation [1, 2, 3]. We have emphasized our closed-surface assumption throughout the introduction. **W4. GeomDist metrics**. We did not intend to present a favorable subset. Of the 10 shapes evaluated for scalability and visualized in the Teaser (Fig. 1), the 7 we reported are those that satisfy our manifold assumption, and on all of them our method outperforms GeomDist. For the remaining 3 non-manifold shapes, while our reconstructions remain visually faithful from the exterior, interior artifacts arising from non-manifoldness disproportionately lower the averaged statistics over all 10 shapes. We openly acknowledge this limitation in the main manuscript, and provide full per-shape metrics and visualizations of the failure cases in the supplementary material. We think the current comparison is fair and prefer to keep experiments that are outside of the scope of the paper in the supplementary. Alternatively, we could compare to the processed shapes as GT, but since the competing methods are very slow (40 h on 4 A100s per shape), we cannot finish such a comparison in the time frame of the rebuttal because we cannot access 4 x A100s. **W5. Generative potential**. Since submission, we have made promising progress in converting patchwork into a regular, grid-like data structure. Specifically, we can analytically convert complex assets (e.g., Loong in Fig. 1) represented by patchworks into a pair of sparse 4K two-channel (RG) textures via octahedral mapping, near-losslessly and with storage equivalent to two sparse $256^3$ grids. We are therefore optimistic about its generative potential and leave this to future work. **References** - [1] Li, Yangguang, et al. "Triposg: High-fidelity 3d shape synthesis using large-scale rectified flow models." IEEE Transactions on Pattern Analysis and Machine Intelligence (2025). - [2] Chen, Rui, et al. "Dora: Sampling and benchmarking for 3d shape variational auto-encoders." 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2025. - [3] Hunyuan3D, Team, et al. "Hunyuan3d 2.1: From images to high-fidelity 3d assets with production-ready pbr material." arXiv preprint arXiv:2506.15442 (2025).