PuzzleFusion++: Auto-agglomerative 3D Fracture Assembly by Denoise and Verify

Zhengqing Wang, Jiacheng Chen, Yasutaka Furukawa
6/1/2024

No official code found. Best implementation: eric-zqwang/puzzlefusion-plusplus (74 stars, last commit 2025-03-08).

Abstract

This paper proposes a novel"auto-agglomerative"3D fracture assembly method, PuzzleFusion++, resembling how humans solve challenging spatial puzzles. Starting from individual fragments, the approach 1) aligns and merges fragments into larger groups akin to agglomerative clustering and 2) repeats the process iteratively in completing the assembly akin to auto-regressive methods. Concretely, a diffusion model denoises the 6-DoF alignment parameters of the fragments simultaneously, and a transformer model verifies and merges pairwise alignments into larger ones, whose process repeats iteratively. Extensive experiments on the Breaking Bad dataset show that PuzzleFusion++ outperforms all other state-of-the-art techniques by significant margins across all metrics, in particular by over 10% in part accuracy and 50% in Chamfer distance. The code will be available on our project page: https://puzzlefusion-plusplus.github.io.

View on arXivView PDF

Code Implementations(1)

Code for paper "PuzzleFusion++: Auto-agglomerative 3D Fracture Assembly by Denoise and Verify" [ICLR 2025]

7410C++, CudaJun 28, 20241 years agoNOASSERTION
3d-assemblydiffusion-modelsshapeassembly

Cite this paper

@article{wang2024puzzlefusion,
  title  = {PuzzleFusion++: Auto-agglomerative 3D Fracture Assembly by Denoise and Verify},
  author = {Zhengqing Wang and Jiacheng Chen and Yasutaka Furukawa},
  year   = {2024},
  eprint = {2406.00259},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2406.00259},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.00259.svg)](https://codeofpaper.com/paper/2406.00259)

Discussion