Learning Hierarchical and Geometry-Aware Graph Representations for Text-to-CAD
Shengjie Gong, Wenjie Peng, Hongyuan Chen, Gangyu Zhang, Yunqing Hu, Huiyuan Zhang, Shuangping Huang, Tianshui Chen
摘要
Text-to-CAD code generation is a long-horizon task, requiring the translation of textual instructions into a long sequence of interdependent operations. This process is exceptionally fragile, as minor early errors can propagate through the sequence and ultimately invalidate an entire complex assembly. Existing methods typically decode instructions directly into executable code (e.g., bpy) without an explicit representation of assembly hierarchy or geometric constraints. This flat decoding strategy vastly expands the search space, accumulating local errors and leading to cascading failures in contextual operations. We address this limitation by learning an intermediate representation: a hierarchical and geometry-aware graph. The graph represents an assembly-based decomposition, with multi-level nodes modeling the product's parts and components, and edges defining the explicit geometric constraints between them. Rather than mapping text directly to code, our graph paradigm first predicts high-level structure and constraints, then conditions the sequencing of operations and code generation, thereby narrowing the search space and improving both geometric fidelity and constraint satisfaction. Furthermore, we introduce a structure-aware progressive curriculum learning mechanism to enhance the model's ability to generate sophisticated decomposition graphs, allowing it to handle more complex assemblies. The mechanism constructs graded tasks via controlled edits to object structure, probes the model's capability boundary, and synthesizes boundary examples for subsequent training rounds. We also introduce a 12K dataset annotated with instructions, geometric decomposition graphs, action sequences, and bpy code, together with metrics for node-and hierarchy-level graph accuracy and a measure of constraint satisfaction. Extensive experiments show that our approach outperforms existing methods in terms of both geometric fidelity and accurate fulfillment of geometric constraints. Code is available at https://github.com/SCUT-MMPR/Graph-CAD .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Plan then Act: Bi-level CAD Command Sequence GenerationQiangya Guo, Gang Dai, Zhuoman Liu, Shuangping Huang 等ICLR 2026
- Towards Human-Like Robot Handwriting via Contour-Aware GenerationYutao Qin, Gang Dai, Yifan Zhang, Youwei Han 等CVPR 2026
它引用的顶会 Paper24
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu 等ICLR 2022 · 被引用 18,833 次
- Gradient Surgery for Multi-Task LearningTianhe Yu, Saurabh Kumar, Abhishek Gupta, Sergey Levine 等NeurIPS 2020 · 被引用 2,261 次
- Fast Inference from Transformers via Speculative DecodingYaniv Leviathan, Matan Kalman, Yossi MatiasICML 2023 · 被引用 1,472 次
- Efficient Memory Management for Large Language Model Serving with PagedAttentionWoosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng 等SOSP 2023 · 被引用 1,016 次
- Conflict-Averse Gradient Descent for Multi-task learningBo Liu, Xingchao Liu, Xiaojie Jin, Peter Stone 等NeurIPS 2021 · 被引用 686 次
相关 Paper
- Multi-Agent CAD Code GenerationYang Liu, Daxuan Ren, Yijie Ding, Jianmin Zheng 等SIGGRAPH 2026
- SketchGen: Generating Constrained CAD SketchesWamiq Reyaz Para, Shariq Farooq Bhat, Paul Guerrero, Tom Kelly 等NeurIPS 2021 · 被引用 114 次
- Vitruvion: A Generative Model of Parametric CAD SketchesAri Seff, Wenda Zhou, Nick Richardson, Ryan P. AdamsICLR 2022 · 被引用 86 次
- CADMate: Generating CAD Assembly Plan with Geometric Chain-of-Thought and Spatial Physical RewardsJiali Chen, DingBa Fu, Xusen Hei, Yuhang Liu 等ACL 2026
- Shape of Thought: Progressive Object Assembly via Visual Chain-of-ThoughtYu Huo, Siyu Zhang, Zeng Kun, Haoyue Liu 等ICML 2026
