- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces Procedura, an agentic framework that uses a frozen LLM to generate editable 3D models as parametric assembly programs. It plans the parts and their connections, builds them one at a time, solves their placement using typed mates, and checks each addition before refining the result with a separate visual critic. The authors evaluate the method on P3D-Bench and their new MechBench-36 benchmark, reporting improvements over existing methods and single-shot generation.
Critical strengths
-
The overall workflow is solid and convincing. The paper explains the pipeline clearly, and the design choices and implementation details are easy to follow.
-
The benchmark is compelling, and the qualitative results are visually impressive. MechBench-36 includes challenging, many-part objects, and the showcased results stand out for their rich detail and clear part structure.
Critical weaknesses
-
The contribution of the core assembly mechanisms is not directly tested. Typed mates, placement solving, and assembly verification are important parts of the method, especially for building valid assemblies that can move correctly in simulation. However, the ablations only cover planning, 3D feedback, and refinement. The paper does report simulation results for the full system, but it does not show how removing these core mechanisms affects assembly correctness or simulation success rates. Such experiments would help establish how much these mechanisms actually contribute.
-
The evaluation focuses more on appearance than on the method’s main practical strengths, and the computational cost is unclear. In my view, a key advantage of this method is its explicit part structure and physically valid assembly, beyond visual quality alone. While the paper evaluates its own articulated outputs in simulation, it does not compare assembly correctness or motion validity against relevant baselines. This would be particularly useful given the small overall judge-score gap to the strongest baseline on MechBench-36. The paper also does not report generation time, cost per object, or the average number of iterations and retries, making it difficult to judge whether the improvements justify the additional computation.
Questions for authors
-
Do you have results showing how removing mate-based placement solving or assembly verification affects assembly correctness and simulation success rates?
-
Have you compared assembly correctness or simulation success rates with baselines that support articulated outputs? This would help establish whether the method’s structural advantages translate into more usable assets.
-
What are the average generation time, API cost or token usage, and number of iterations and retries per object? How do these compare with the same-model Codex agent baseline, and were their generation budgets comparable?
3 comments
Thank you for your response. my concerns have been addressed, and I will raise my rating to 4.
Thank you for reading our response so carefully and for raising your score. Your questions about how much the mates contribute, and how Procedura compares with an agent baseline on assembly and simulation, led directly to the new experiments. We will add all of them to the revision: the with/without-mates ablation, the Isaac comparison with Codex, and the time, token and iteration breakdown. Thank you again for your constructive review.
We sincerely thank Reviewer ip99 for the encouraging review, and for finding the workflow "solid and convincing" and MechBench-36 "compelling". You put your finger on the method's main practical strengths, explicit part structure and physically valid assembly, and we ran new experiments to measure exactly those.
Ablating the mates (W1, Q1). We ran Procedura with and without mates on all 36 objects, with GPT-6-luna at max effort. Without mates, the plan declares no mates, static or kinematic: the mating-feature library and its prompts, each part's joint and its measurement, and the mate exemption from the connectivity gate are all removed. The compile and connectivity gates stay on. Both versions run the full pipeline, including refine, and were launched side by side, so they share serving conditions.
Mates act where they are designed to act, on how the parts fit and move. A joint is partly blocked when the built contact between the moving part and its parent resists the planned motion. All joints free means the object passes Isaac and none of its joints is partly blocked. With mates, 17.1% of joints are partly blocked, against 28.1% without, and twice as many objects pass with every joint free (12 vs 6).
Assembly and simulation success against baselines (W2, Q2). We passed the same-model Codex agent's 36 models (GPT-6-luna, max) through our exporter and Isaac Sim battery. Procedura passes 27/36 vs 6/36: 21 objects pass only with Procedura and none only with Codex (p<0.001). Procedura's models carry 346 moving joints, against 23 for Codex. The structural advantages you point to translate directly into usable assets. 28 of Codex's 36 models export as a single rigid body, while every Procedura model is articulable. Joint fit is our main avenue for improvement: on the 7 objects where both methods have joints, 21% of Procedura's joints and 4.5% of Codex's are partly blocked (not significant).
Time, tokens, iterations and budgets (W2, Q3). Per object at max effort, with the same model, prompt, image and API for both methods:
Procedura uses half the calls and 3.7× fewer tokens. Most of Codex's volume is cached re-reads, so we list all three token classes, which lets either method be priced exactly. The wall-clock difference has two sources. The build is sequential: each part is one model call that sees the compiled build so far, and the part is compiled and checked before the next one starts. Each of those calls also reasons at length: at max effort a Procedura call uses a median of 10K reasoning tokens and takes about 4 minutes, while Codex's many short tool-use steps use 176 tokens and 31 s. Procedura spends its time reasoning about each part rather than re-reading context.
Budgets. Both methods ran under the same 4-hour wall-clock cap. Procedura needs longer than 2 h on half the objects. Run to completion, it leads Codex (0.650 vs 0.597) with 3.7× fewer tokens.
We will report all of this in the revision.
Thank you again for these constructive questions. We hope the new results establish how much the mechanisms contribute, and we would be grateful if you would consider raising your score.