B-Rep Distance Functions (BR-DF): How to Represent a B-Rep Model by Volumetric Distance Functions?
By: Fuyang Zhang , Pradeep Kumar Jayaraman , Xiang Xu and more
Potential Business Impact:
Makes computer designs perfectly without errors.
This paper presents a novel geometric representation for CAD Boundary Representation (B-Rep) based on volumetric distance functions, dubbed B-Rep Distance Functions (BR-DF). BR-DF encodes the surface mesh geometry of a CAD model as signed distance function (SDF). B-Rep vertices, edges, faces and their topology information are encoded as per-face unsigned distance functions (UDFs). An extension of the Marching Cubes algorithm converts BR-DF directly into watertight CAD B-Rep model (strictly speaking a faceted B-Rep model). A surprising characteristic of BR-DF is that this conversion process never fails. Leveraging the volumetric nature of BR-DF, we propose a multi-branch latent diffusion with 3D U-Net backbone for jointly generating the SDF and per-face UDFs of a BR-DF model. Our approach achieves comparable CAD generation performance against SOTA methods while reaching the unprecedented 100% success rate in producing (faceted) B-Rep models.
Similar Papers
Smooth geometry extraction from SIMP topology optimization: Signed distance function approach with volume preservation
Computational Engineering, Finance, and Science
Makes computer designs smooth for building.
Learning Compact Latent Space for Representing Neural Signed Distance Functions with High-fidelity Geometry Details
CV and Pattern Recognition
Lets computers create detailed 3D shapes from many examples.
Voronoi-Assisted Diffusion for Computing Unsigned Distance Fields from Unoriented Points
CV and Pattern Recognition
Makes 3D shapes from messy dots.