提出GraphBrep,用图结构显式建模拓扑,提升CAD生成效率
GraphBrep: Learning B-Rep in Graph Structure for Efficient CAD Generation
- 构建无向加权图表示表面拓扑,分离几何与拓扑信息
- 在三个数据集上训练和推理时间分别降低31.3%和56.3%
- 适合需要高效生成高质量CAD模型的研究者与工业用户
直接生成边界表示(B-Rep)在CAD工作流中日益重要,可避免昂贵的建模序列数据并支持复杂特征。核心挑战在于建模几何与拓扑之间的非对齐联合分布。现有方法通常将拓扑隐式嵌入边的几何特征中,虽保证特征对齐,但导致边几何携带冗余结构信息,显著增加计算开销。为此,我们提出GraphBrep,一种显式表示并学习紧凑拓扑的B-Rep生成模型。遵循原始B-Rep结构,构建无向加权图表示表面拓扑;采用图扩散模型基于表面特征学习拓扑,作为确定原始表面连接性的基础。显式表示确保数据结构紧凑,在训练和推理阶段均有效降低计算成本。在两个大规模无条件数据集和一个类别条件数据集上的实验表明,该方法相比当前最优(SOTA)显著减少训练和推理时间(分别最多降低31.3%和56.3%),同时保持高质量的CAD生成效果。
原文摘要 · Abstract (English)
Direct B-Rep generation is increasingly important in CAD workflows, eliminating costly modeling sequence data and supporting complex features. A key challenge is modeling joint distribution of the misaligned geometry and topology. Existing methods tend to implicitly embed topology into the geometric features of edges. Although this integration ensures feature alignment, it also causes edge geometry to carry more redundant structural information compared to the original B-Rep, leading to significantly higher computational cost. To reduce redundancy, we propose GraphBrep, a B-Rep generation model that explicitly represents and learns compact topology. Following the original structure of B-Rep, we construct an undirected weighted graph to represent surface topology. A graph diffusion model is employed to learn topology conditioned on surface features, serving as the basis for determining connectivity between primitive surfaces. The explicit representation ensures a compact data structure, effectively reducing computational cost during both training and inference. Experiments on two large-scale unconditional datasets and one category-conditional dataset demonstrate the proposed method significantly reduces training and inference times (up to 31.3% and 56.3% for given datasets, respectively) while maintaining high-quality CAD generation compared with SOTA.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。