论文标题
素描图:用于建模计算机辅助设计的大规模数据集
SketchGraphs: A Large-Scale Dataset for Modeling Relational Geometry in Computer-Aided Design
论文作者
论文摘要
参数计算机辅助设计(CAD)是实体设计机械工程的主要范式。通过关系几何形状区分,参数CAD模型以二维草图开头,这些草图由几何原始物(例如,线段,弧线)和它们之间的显式约束(例如,巧合,垂直度)之间的显式约束,这些约束构成了三维建筑操作的基础。训练机器学习模型以推理和合成参数CAD设计有可能减少设计时间并实现新的设计工作流程。此外,可以将参数CAD设计视为约束编程的实例,它们为探索程序合成和归纳的想法提供了良好的测试床。为了促进这项研究,我们介绍了素描图,这是一个从现实世界中CAD模型中提取的1500万个草图,并加上开源数据处理管道。每个草图表示为几何约束图,其中边缘表示设计师施加的几何关系,图形的节点之间的几何关系。我们为数据集的两个用例演示并建立基准:草图的生成建模和有条件地生成可能的约束,给定的几何形状。
Parametric computer-aided design (CAD) is the dominant paradigm in mechanical engineering for physical design. Distinguished by relational geometry, parametric CAD models begin as two-dimensional sketches consisting of geometric primitives (e.g., line segments, arcs) and explicit constraints between them (e.g., coincidence, perpendicularity) that form the basis for three-dimensional construction operations. Training machine learning models to reason about and synthesize parametric CAD designs has the potential to reduce design time and enable new design workflows. Additionally, parametric CAD designs can be viewed as instances of constraint programming and they offer a well-scoped test bed for exploring ideas in program synthesis and induction. To facilitate this research, we introduce SketchGraphs, a collection of 15 million sketches extracted from real-world CAD models coupled with an open-source data processing pipeline. Each sketch is represented as a geometric constraint graph where edges denote designer-imposed geometric relationships between primitives, the nodes of the graph. We demonstrate and establish benchmarks for two use cases of the dataset: generative modeling of sketches and conditional generation of likely constraints given unconstrained geometry.