mlsanityData to 7 Oct 2026

Learning to Assemble Geometric Shapes

arXiv 2205.11809 ↗First posted 24 May 2022cs.CV cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit parts or jigsaw-style parts of textured shapes, which greatly mitigate combinatorial challenges of the problem. In this work, we introduce the more challenging problem of shape assembly, which involves textureless fragments of arbitrary shapes with indistinctive junctions, and then propose a learning-based approach to solving it. We demonstrate the effectiveness on shape assembly tasks with various scenarios, including the ones with abnormal fragments (e.g., missing and distorted), the different number of fragments, and different rotation discretization.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 11 of its 34 references that are in the map. First posted on arXiv 24 May 2022.

Builds on

11 of 34 references.

References · 11

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2017Deep Setscited by 1,394
  4. 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,379
  5. 2019Form2Fit: Learning Shape Priors for Generalizable Assembly from Disassemblycited by 51
  6. 2019Structured agents for physical constructioncited by 50
  7. 2021Brick-by-Brick: Combinatorial Construction with Deep Reinforcement Learningcited by 19
  8. 2018Solving Archaeological Puzzlescited by 15
  9. 2016Permutation-equivariant neural networks applied to dynamics predictioncited by 14
  10. 2020Combinatorial 3D Shape Generation via Sequential Assemblycited by 13
  11. 2020PackIt: A Virtual Environment for Geometric Planningcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 1.

3 papers.