- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
Sketch2BRep generates B-Rep CAD models from a single sketch through a boundary-first pipeline. It first generates 3D boundary curves using shape–layout coupled diffusion, then synthesizes boundary-conditioned surfaces, and finally predicts face–edge relationships to assemble the B-Rep. Experiments on DeepCAD and ABC evaluate geometric accuracy, topology, sketch consistency, and validity, with ablations examining the proposed components and generation order.
Critical strengths
Strengths
- Clear presentation and well-motivated design. The paper clearly explains the challenges of recovering geometry and topology from sparse sketches. Using explicit boundaries as an intermediate representation provides a coherent connection between sketch cues and surface generation.
- Promising results with supporting ablations. The reported comparisons show improvements in geometry, topology, and sketch consistency. Component ablations and the controlled boundary-first versus surface-first comparison provide useful evidence for the proposed design.
Critical weaknesses
Weaknesses
- Unclear handling of primitive counts. The paper defines variable-sized edge and face sets but does not clearly explain how their sizes are determined at inference time. Since diffusion requires an initial noise tensor of a specified shape, the authors should clarify how edge and face counts are selected, how variable-length sets are handled, and whether padding, duplication, or filtering is used. This is important for understanding whether generation operates from the sketch alone or requires additional count information.
Questions for authors
As weakness.
2 comments
Thanks for your response, I will maintain my score.
Questions: Unclear handling of primitive counts. The paper defines variable-sized edge and face sets but does not clearly explain how their sizes are determined at inference time. Since diffusion requires an initial noise tensor of a specified shape, the authors should clarify how edge and face counts are selected, how variable-length sets are handled, and whether padding, duplication, or filtering is used. This is important for understanding whether generation operates from the sketch alone or requires additional count information.
Response: Thank you for pointing out this important implementation detail. We apologize for the insufficient clarification of how variable-sized edge and face sets are handled during inference.
To select edge and face counts at inference, our Sketch2BRep follows a strategy similar to BrepGen (Xu et al., 2024). Specifically, it adopts fixed-capacity diffusion followed by geometric deduplication and validity filtering, rather than explicitly predicting primitive counts. The boundary diffusion stage initializes a predefined number of candidate edge tokens from Gaussian noise, where each token contains an edge point latent, corner coordinates, and a bounding box. These geometric attributes are jointly denoised under the guidance of the input sketch. After denoising, redundant edge candidates are identified by comparing their predicted bounding boxes and removed using a predefined similarity threshold. The remaining edges are further examined through endpoint matching and connectivity analysis to determine whether they can form closed boundary loops. Geometrically inconsistent candidates are filtered out, yielding a variable-sized boundary set that provides structural guidance for subsequent surface generation. Conditioned on the retained boundaries, the surface diffusion stage similarly initializes a fixed number of candidate face tokens from Gaussian noise. Each face token consists of a surface point latent and a bounding box, which are jointly generated through the Boundary-Conditioned Joint Surface Diffusion to maintain consistency between surface geometry, spatial layout, and the recovered boundaries. After denoising, redundant face candidates are removed based on bounding-box similarity. The remaining candidates are further validated using the face-edge relationships predicted by Geometry-Aware RelationNet. Specifically, the associated boundary edges are examined to determine whether they can form closed trimming loops. For faces with insufficient incident edges, additional high-confidence edge candidates are considered to complete the boundary. Faces that still fail the boundary consistency checks are excluded from the final B-Rep reconstruction.
To handle variable-length primitive sets, we employ fixed-capacity representations, padding masks, and geometric filtering rather than duplicating valid primitives. This scheme ensures that padded or filtered tokens do not interfere with subsequent feature interactions. The predefined capacities specify only the shapes of the initial Gaussian noise tensors, whereas the effective numbers of edges and faces are determined by geometric deduplication, connectivity analysis, and validity filtering.
In the rebuttal version, we have added a dedicated section Appendix A.2 (Inference and Post-Processing), providing more implementation details on the initialization capacities, deduplication criteria, closed-loop validation, and padding-mask strategy.
Reference:
Xiang Xu, Joseph George Lambourne, Pradeep Kumar Jayaraman, Zhengqing Wang, Karl D. D. Willis, and Yasutaka Furukawa. Brepgen: A b-rep generative diffusion model with structured latent geometry. ACM Transactions on Graphics, 43(4):1–14, 2024.