GraphBrep replaces the redundant tree-based topology of prior B-Rep generators with an explicit graph adjacency representation, cutting training and inference cost while preserving generation quality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
GraphBrep: Learning B-Rep in Graph Structure for Efficient CAD Generation
GraphBrep replaces the redundant tree-based topology of prior B-Rep generators with an explicit graph adjacency representation, cutting training and inference cost while preserving generation quality.