ComplexGen
Authors:
Open Access
- 22 July 2022
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 41 (4) , 1-18
Abstract
We view the reconstruction of CAD models in the boundary representation (B-Rep) as the detection of geometric primitives of different orders, i.e. , vertices, edges and surface patches, and the correspondence of primitives, which are holistically modeled as a chain complex, and show that by modeling such comprehensive structures more complete and regularized reconstructions can be achieved. We solve the complex generation problem in two steps. First, we propose a novel neural framework that consists of a sparse CNN encoder for input point cloud processing and a tri-path transformer decoder for generating geometric primitives and their mutual relationships with estimated probabilities. Second, given the probabilistic structure predicted by the neural network, we recover a definite B-Rep chain complex by solving a global optimization maximizing the likelihood under structural validness constraints and applying geometric refinements. Extensive tests on large scale CAD datasets demonstrate that the modeling of B-Rep chain complex structure enables more accurate detection for learning and more constrained reconstruction for optimization, leading to structurally more faithful and complete CAD B-Rep models than previous results.Keywords
This publication has 12 references indexed in Scilit:
- UV-Net: Learning from Boundary Representations2021
- ParSeNet: A Parametric Surface Fitting Network for 3D Point Clouds2020
- End-to-End Object Detection with Transformers2020
- 4D Spatio-Temporal ConvNets: Minkowski Convolutional Neural Networks2019
- ABC: A Big CAD Model Dataset for Geometric Deep Learning2019
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksIEEE Transactions on Pattern Analysis and Machine Intelligence, 2016
- GlobFitACM Transactions on Graphics, 2011
- Recent advances in the solution of quadratic assignment problemsMathematical Programming, 2003
- Algorithms for the Assignment and Transportation ProblemsJournal of the Society for Industrial and Applied Mathematics, 1957
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955