Jones, RK;
Barton, T;
Xu, X;
Wang, K;
Jiang, E;
Guerrero, P;
Mitra, NJ;
(2020)
ShapeAssembly: Learning to Generate Programs for 3D Shape Structure Synthesis.
ACM Transactions on Graphics
, 39
(6)
, Article 234. 10.1145/3414685.3417812.
Preview |
Text
shapeAssembly.pdf - Accepted Version Download (29MB) | Preview |
Abstract
Manually authoring 3D shapes is difficult and time consuming; generative models of 3D shapes offer compelling alternatives. Procedural representations are one such possibility: they offer high-quality and editable results but are difficult to author and often produce outputs with limited diversity. On the other extreme are deep generative models: given enough data, they can learn to generate any class of shape but their outputs have artifacts and the representation is not editable. In this paper, we take a step towards achieving the best of both worlds for novel 3D shape synthesis. First, we propose ShapeAssembly, a domain-specific "assembly-language" for 3D shape structures. ShapeAssembly programs construct shape structures by declaring cuboid part proxies and attaching them to one another, in a hierarchical and symmetrical fashion. ShapeAssembly functions are parameterized with continuous free variables, so that one program structure is able to capture a family of related shapes. We show how to extract ShapeAssembly programs from existing shape structures in the PartNet dataset. Then, we train a deep generative model, a hierarchical sequence VAE, that learns to write novel ShapeAssembly programs. Our approach leverages the strengths of each representation: the program captures the subset of shape variability that is interpretable and editable, and the deep generative model captures variability and correlations across shape collections that is hard to express procedurally. We evaluate our approach by comparing the shapes output by our generated programs to those from other recent shape structure synthesis models. We find that our generated shapes are more plausible and physically-valid than those of other methods. Additionally, we assess the latent spaces of these models, and find that ours is better structured and produces smoother interpolations. As an application, we use our generative model and differentiable program interpreter to infer and fit shape programs to unstructured geometry, such as point clouds.
| Type: | Article |
|---|---|
| Title: | ShapeAssembly: Learning to Generate Programs for 3D Shape Structure Synthesis |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3414685.3417812 |
| Publisher version: | https://doi.org/10.1145/3414685.3417812 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| Keywords: | Computing methodologies, Neural networks, Latent variable models, Shape analysis |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of the Built Environment UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of the Built Environment > Bartlett School Env, Energy and Resources |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10122578 |
Archive Staff Only
 |
View Item |
