- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper focuses on CAD generation from multimodal design intent input. It trains a multimodal foundation model for part generation, develops a data construction pipeline and a multi-stage training strategy, and designs an agent framework for assembly tasks.
Critical strengths
Investigating CAD program generation from multimodal design intent inputs (text descriptions, engineering drawings, real product photographs, and rendered views) is a reasonable research direction.
Critical weaknesses
-
Lines 90–93 mention a test-time scaling method (parallel-TTS) as one of the contributions. However, the paper does not describe how this method is designed and implemented.
-
The description of the data curation pipeline is unclear. According to Section 4.1, Data CURATION PIPELINE, the data construction process consists of two paths: intent i → CAD program p → shape s, and shape s → CAD program p→ intent i. I have several questions regarding these two paths.
-
As mentioned in Lines 69–70, intent is multimodal, including text descriptions, engineering drawings, real product photographs, and rendered views. However, the description of the i→ p → s pipeline in Section 4.1 indicates that image editing is first applied to the intent. Does this step only apply to image-based intents? How are intents in the form of text descriptions and engineering drawings handled?
-
Line 232 states that the i → p → s pipeline searches for the nearest-neighbor CAD program (p) given an intent (i) and a shape (s). This is confusing. First, the process would seem more naturally structured as i → s → p. More importantly, how is the CAD program retrieved? Is there a library containing a large number of CAD programs without corresponding intent labels? If so, how to ensure that a suitable CAD program can always be found in this library for a given intent? If no such library exists, how is the CAD program search performed?
-
For the s → p→ i path, the main text provides only a brief description in Lines 233–234. This is an important part of the data construction process and deserves a more detailed explanation.
-
-
The training pipeline in Section 4.2 is also confusing.
-
Lines 248–251 state that, during the Robust SFT stage, crawled product images are used as intents, and a teacher model is employed to generate multiple candidate CAD programs for the same intent. This raises several questions: Where does the teacher model come from? Do the crawled product images have corresponding ground-truth (GT) CAD programs? How is this training stage implemented?
-
The Continual High-quality SFT stage is described in only one sentence in Lines 251–252, making it difficult to understand how this stage is trained.
-
Furthermore, the paper states that intents include text descriptions, engineering drawings, real product photographs, and rendered views. However, the training pipeline in Section 4.2 mentions only image-based intents. How are text-description and engineering-drawing inputs incorporated into the training process?
-
-
What metrics are reported in the main results table (Table 1)? The Design Artifacts and Metrics section does not adequately define or explain them.
Questions for authors
Please refer to the weaknesses
3 comments
Thanks for the replies. However, my concerns remain unresolved.
- As one of the contributions, Parallel TTS lacks the necessary explanation in both the Introduction and the method section. While its performance improvement is only validated in experimental analysis, I cannot recognize the motivation for introducing it or its contribution.
- The response addresses the data construction process for the Image intent, but it still does not answer how to handle the intent of text descriptions and engineering drawings.
- The training process uses Gemini-3.1-Pro as the distillation teacher. How can the effectiveness of using such a general-purpose LLM as a teacher model for CAD-specific tasks be demonstrated?
Considering the above, I will not change my score.
Response to Reviewer 88KJ
Thank you for the follow-up. We address the three remaining concerns with concrete records from our pipeline.
(1) Motivation and mechanism of parallel test-time selection. CAD candidates vary in quality and can be verified through execution. Using the off-the-shelf Qwen3.8-27B, we sampled 16 programs per input across 2,845 inputs. The per-sample execution success rate was 0.856, and every input had at least one executable candidate. Successful candidates averaged 0.382 Solid IoU; selecting the best per input using ground truth achieved 0.529. This oracle result is an upper bound, not a deployable result, but shows the potential benefit of selection.
Our selector uses no ground truth. Given the original input, candidate programs, and six-view renders, a VLM ranks the candidates in one request. On a fixed pool of eight VisCAD-M1 samples per input, random selection among executable candidates achieved 0.3865/0.1570 Solid/Surface IoU; listwise selection achieved 0.4108 ± 0.0018 / 0.1721 ± 0.0016 over five runs. Thus, the gain extends beyond filtering execution failures.
An input-modality ablation on eight slices with 2,472 inputs yielded Solid IoU of 0.3633 for random selection, 0.3475 for code only, 0.3749 for renders only, and 0.3835 for code plus renders. This suggests that rendered geometry is the main selection signal.
(2) Text and engineering-drawing intents. Neither branch uses the photo-editing or image-to-3D steps in Section 4.1. Text descriptions are passed directly to Gemini-3.1-Pro without images; engineering drawings are rasterized from PDF and passed with reconstruction instructions. The teacher generates FreeCAD Python programs, which must execute to produce a valid shape with exactly one solid and a non-empty STEP export. Failed programs receive up to two execution-guided repair attempts.
With 12 candidates per input, 4,249/4,800 text candidates passed initially and 98.0% after repair. For engineering drawings, 60.6% passed initially and 89.4% after repair. We will clarify the per-modality procedures in the revision.
(3) Evidence that a general-purpose model can serve as a CAD teacher. First, Gemini-3.1-Pro evaluated zero-shot under our protocol is among the strongest models on both benchmarks, providing evidence of its CAD-generation capability without task-specific fine-tuning.
Second, the pipeline treats the teacher as a candidate generator rather than accepting its outputs unconditionally. Every candidate must pass the execution validator described above, and failed candidates can be repaired using execution feedback. Across the text and engineering-drawing batches, 5,748 of 7,272 candidates passed initially, increasing to 6,913 after repair.
Response to Reviewer 88KJ
Thank you for the review. We clarify the method using the existing descriptions and the concrete implementation details supplied below. The algorithm-level description and the remaining reproducibility details should be distinguished.
1. Parallel test-time scaling.
We respectfully disagree that parallel TTS lacks an algorithmic description.
Section 6.2 describes sequential refinement and parallel selection. In parallel selection, M1 generates k programs for the same intent and reuses itself as a listwise reranker over candidate programs and rendered geometry. Table 3 compares k=8 without thinking, k=8 with thinking, and k=16 with thinking; the text also reports that sequential refinement did not improve results. The core selection procedure and these comparisons are therefore present in the paper.
Recomputing the displayed rows gives base M1 0.5530 and the 16-candidate variant 0.5833, an increase of approximately 0.03037. The original base aggregate requires correction. This is an observed selection gain under the reported settings; it does not establish superiority to frontier models at equal sampling budgets. The exact prompt, sampling parameters, candidate packaging, and invalid-candidate handling still need documentation for reproduction.
2. Program search and data dependencies.
We maintain that the described search generates and refines programs rather than requiring library retrieval.
The described image-origin procedure normalizes visual evidence, obtains a proxy shape, and uses teacher generation, execution, and feedback to produce/refine a CAD program. It is a program-synthesis procedure and does not require a pre-existing nearest-neighbor program library. The proxy shape supplies a reference for checking the executed candidate; it can be constructed before the program.
For program-origin data, executing the known program produces a shape, which can be projected into visual intents. For shape-origin data, STEP/STL assets can directly supply renders, while missing programs require synthesis and verification. Thus rendering depends on the shape and need not wait for program recovery. We will replace the compressed pathway notation with these explicit dependencies.
The image-editing description concerns the visual branch. It does not specify how text labels or dimensioned engineering-drawing supervision are constructed. Drawing-style image augmentation is not sufficient evidence of the latter. Those per-modality construction details remain missing from the present account and cannot be inferred from the image pathway alone.
3. Teacher, training stages, and acceptance criteria.
We maintain that the teacher and the two selection criteria can be specified concretely.
M1 initializes from Qwen3.8-27B. It first receives large-scale SFT with CadQuery targets (approximately 0.5-1.0M examples), using visual intents rendered from executed programs. Subsequent SFT uses FreeCAD targets. Gemini-3.1-Pro is the primary distillation teacher.
Robust SFT uses approximately 150,000 industrial-image examples with synthesized program targets, retained when they execute successfully in FreeCAD. These are teacher-generated targets; crawled images are not assumed to have vendor ground-truth programs. High-quality SFT uses approximately 10,000 curated examples, selecting executed candidates with IoU > 0.7 against the training reference gt_shape. This specifies a geometric acceptance condition beyond execution success.
A generated gt_shape remains a proxy. Passing the threshold does not guarantee correct hidden geometry, and multiple teacher targets do not guarantee removal of shared errors. We will use verifier-refined to describe the targets rather than imply global optimality. Generation/refinement budgets, stopping rules, and the text/drawing training construction still require explicit documentation; the stated stages and threshold do not substitute for those details.
4. Metrics in the main table.
We maintain that the paper supplies an explicit scoring protocol.
Section 5.1 and the appendix define the four components. Executability counts all assigned tasks. Solid IoU measures filled-volume overlap and Surface IoU boundary-voxel overlap, using signed-PCA alignment, uniform-scale normalization, R=96, and 2% padding. The Part Judge assesses shape, salient features, and functional plausibility from input evidence and output renders; the prompts are included in the appendix.
Eq. (4) averages executability, Solid IoU, Surface IoU, and Judge/100. Quality terms use evaluator-available artifacts, whereas executability uses the assigned set. These definitions specify what the reported quantities measure and how they are combined. They concern executed geometry, not absolute dimensions, feature histories, or editability. We will make the definitions and their denominators more prominent in the main text.