TL;DR
This paper introduces BSP-Net, a novel neural network that leverages binary space partitioning to efficiently learn and generate polygonal meshes with convex decomposition, achieving high-quality 3D shape reconstructions with fewer primitives.
Contribution
BSP-Net is the first neural model to utilize binary space partitioning for unsupervised convex decomposition of 3D shapes into meshes, improving efficiency and quality.
Findings
Competitive reconstruction quality with fewer primitives
Meshes are watertight, low-poly, and capture sharp geometry
Versatile with extensions to generative models and different primitives
Abstract
Polygonal meshes are ubiquitous, but have only played a relatively minor role in the deep learning revolution. State-of-the-art neural generative models for 3D shapes learn implicit functions and generate meshes via expensive iso-surfacing. We overcome these challenges by employing a classical spatial data structure from computer graphics, Binary Space Partitioning (BSP), to facilitate 3D learning. The core operation of BSP involves recursive subdivision of 3D space to obtain convex sets. By exploiting this property, we devise BSP-Net, a network that learns to represent a 3D shape via convex decomposition without supervision. The network is trained to reconstruct a shape using a set of convexes obtained from a BSP-tree built over a set of planes, where the planes and convexes are both defined by learned network weights. BSP-Net directly outputs polygonal meshes from the inferred…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
