Searcharxiv⌕ Search

arXiv · 2611.22903

BRepA: Graph-Based B-Rep Pretraining for Unified CAD Understanding and Generation

Abstract

Boundary representation (B-Rep) of CAD models encodes geometric primitives and their relations as a graph structure, enabling efficient shape modeling within CAD software. Learning on B-Reps for downstream tasks, such as segmentation and novel shape generation, requires specialized neural network designs. Moreover, performance improvements and accelerated training can be achieved with effective pretraining strategies, which is particularly important for tasks with limited labeled B-Rep data. In this paper, we introduce BRepA, a unified self-supervised pretraining framework that explicitly reconstructs both the geometry and topology of B-Rep objects via graph-based modeling. By learning from large-scale unlabeled CAD data only once, BRepA produces representations that generalize across tasks and significantly enhance both discriminative and generative learning. On segmentation tasks, BRepA demonstrates remarkable data efficiency. For instance, with only 1% labeled samples, BRepA pretraining improves mIoU by 32.52% compared to models trained from scratch. On generative tasks, aligning diffusion model representations with pretrained BRepA features substantially accelerates convergence, achieving nearly 2 times faster training while improving generation quality under the same computational budget, despite the diffusion model being roughly 20 times larger than BRepA. Overall, our results show that geometry- and topology-aware B-Rep pretraining provides a powerful foundation for both understanding and generating CAD structures, serving as a versatile representation backbone for diverse downstream applications. We will release the code to facilitate future research.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dekai Zhu, Zhaiyu Chen, Stefan Gavranovic, Slobodan Ilic. 2026-11-17. BRepA: Graph-Based B-Rep Pretraining for Unified CAD Understanding and Generation. https://searcharxiv.com/abs/2611.22903

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

RTime-QA: A Benchmark for Atomic Temporal Event Understanding in Multimodal Large Language Models

Multimodal large language models (MLLMs) perform well on video benchmarks, yet many video questions can be answered from a single frame or from language priors, which leaves open whether these models perceive how an event unfolds in time. We introduce \rtqa, a benchmark for atomic temporal event understanding built on time-reversed question pairs: each video is accompanied by its reversal, and each question is asked on both videos with identical text and options but different correct answers, so that a deterministic model that ignores the order of the frames cannot answer both. \rtqa{} comprises 8,420 questions of five types on 1,278 videos, 639 videos and their reversals. The questions are derived from event annotations that a proposer model writes, a reviewer model checks and human annotators verify, and three subsets target fast evaluation (\rtqatiny), questions that are hard to answer from the first and last frames (\rtqacore) and two consecutive events (\rtqacomp). All 20 evaluated models are less accurate on reversed videos. On \rtqafull, proprietary models answer both questions of 90.6--94.4\% of the pairs and the strongest open-source model of 66.8\%; on \rtqacore, the proprietary models drop to 55.6--64.5\%, and shuffling the frames reduces the paired accuracy of the tested open-source models to 3.4--7.4\%. We further build \rtqatrain{} with the same pipeline, without human verification, and train three open-source MLLMs on it with supervised fine-tuning (SFT) and reinforcement learning (DAPO) under matched settings: both raise paired accuracy on \rtqafull, SFT by 20.7--27.4 points and DAPO by 5.9--22.9 points. For Qwen3.5-9B-Thinking, the training data also help on two other temporal benchmarks: SFT and DAPO raise the Vinoground text score by 5.8 and 3.8 points, respectively, and DAPO raises the TVBench macro accuracy by 4.6 points.

cs.CV↗

Morphology-driven single-domain generalization for cross-cohort Alzheimer's disease detection using 3D MRIs

Although Alzheimer's disease detection via MRIs has advanced significantly thanks to contemporary deep learning models, challenges such as class imbalance, protocol variations, and limited dataset diversity often hinder their generalization capacity. To address this issue, this article focuses on the single domain generalization setting, where given the data of one domain, a model is designed and developed with maximal performance w.r.t. an unseen domain of distinct distribution. Since brain morphology is known to play a crucial role in Alzheimer's diagnosis, we propose the use of learnable pseudo-morphological modules aimed at producing shape-aware, anatomically meaningful class-specific augmentations in combination with a supervised contrastive learning module to extract robust class-specific representations. Experiments conducted across three datasets show improved performance and generalization capacity, especially under class imbalance and imaging protocol variations. The source code will be made available upon acceptance at https://github.com/zobia111/SDG-Alzheimer.

cs.CV↗

Evaluating and Mitigating Skin Color Bias in Skin Lesion Classificatio

Skin lesion classifiers may overlook performance disparity because of subtle skin tone variations by treating skin tone as a categorical attribute. This study proposes a method that represents skin tone as a continuous attribute and assigns individual weights to each sample based on its nonlinear relationship with classification performance. Evaluations on two dermatological datasets showed that fairness metrics were sensitive to skin-color categorization. The proposed method also demonstrated more stable fairness improvements than conventional categorical reweighting while generally preserving classification performance.

cs.CV↗