AIApr 11

Learning Hierarchical and Geometry-Aware Graph Representations for Text-to-CAD

arXiv:2604.1007572.0h-index: 3
Predicted impact top 47% in AI · last 90 daysOriginality Incremental advance
AI Analysis

For researchers and practitioners in CAD automation, this work addresses the bottleneck of long-horizon code generation by explicitly modeling assembly structure and constraints, reducing error accumulation.

Text-to-CAD code generation suffers from cascading failures in complex assemblies due to lack of hierarchical and geometric modeling. The proposed method uses a hierarchical and geometry-aware graph as intermediate representation, achieving consistent improvements in geometric fidelity and constraint satisfaction over existing approaches.

Text-to-CAD code generation is a long-horizon task that translates textual instructions into long sequences of interdependent operations. Existing methods typically decode text directly into executable code (e.g., bpy) without explicitly modeling assembly hierarchy or geometric constraints, which enlarges the search space, accumulates local errors, and often causes cascading failures in complex assemblies. To address this issue, we propose a hierarchical and geometry-aware graph as an intermediate representation. The graph models multi-level parts and components as nodes and encodes explicit geometric constraints as edges. Instead of mapping text directly to code, our framework first predicts structure and constraints, then conditions action sequencing and code generation, thereby improving geometric fidelity and constraint satisfaction. We further introduce a structure-aware progressive curriculum learning strategy that constructs graded tasks through controlled structural edits, explores the model's capability boundary, and synthesizes boundary examples for iterative training. In addition, we build a 12K dataset with instructions, decomposition graphs, action sequences, and bpy code, together with graph- and constraint-oriented evaluation metrics. Extensive experiments show that our method consistently outperforms existing approaches in both geometric fidelity and accurate satisfaction of geometric constraints.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes