3D part segmentation

RePart

Organize Primitives into Semantic Parts:
Reinforcement Reasoning for 3D Segmentation

Xiaoming Gong1,* Ruoyu Wu2,* Zhenhong Sun3 Chunlin Chen1 Daoyi Dong4 Huadong Mo2 Zhi Wang1 Hongdong Li3
1 Nanjing University, China 2 University of New South Wales, Canberra, Australia 3 Australian National University, Australia 4 University of Technology Sydney, Australia

* Equal contribution

A three-panel figure: a chair decomposed into primitives, examples of primitive-to-part ambiguity, and sequential grouping as a Markov decision process.
Primitive decomposition supplies compact structure. RePart organizes those primitives into semantic parts through sequential merge-and-stop decisions.

The problem

Abstract

Primitive-based 3D segmentation offers a compact and explicit alternative to dense surface prediction, but geometric decomposition alone does not determine which primitives belong to the same semantic part. One part may span several primitives, while nearby primitives with similar geometry may belong to different parts.

RePart treats primitive-to-part organization as a finite-horizon decision process. A merge-and-stop policy learns to group fine-grained superquadrics according to their effect on the final partition, then transfers the inferred identities back to the original mesh with boundary-aware surface labeling. Training uses part annotations, while the deployed policy relies on geometry alone.

How it works

From a primitive workspace to dense part labels

RePart separates compact structural reasoning from boundary localization on the original surface.

Overview of RePart: SQ workspace construction, progressive merge-and-stop reasoning, and surface labeling of the original mesh.
Overview of the three stages of RePart. The policy uses geometry-only observations at inference; ground-truth part labels supervise training.
01

Composable Primitive Workspace

Over-segmented superquadrics provide stable, geometric tokens without fixing the final semantic partition.

02

Reinforcement-Learning Part Reasoning

A policy repeatedly merges groups or stops. PPO evaluates decisions through their downstream effect on the partition.

03

Boundary-Aware Surface Labeling

Terminal group identities are projected onto the original mesh using surface proximity and volumetric evidence.

Quantitative results

Partition quality across datasets

Strong in-domain performance on PartNet, with metric-dependent transfer to 3DCoMPaT++ without target-dataset fine-tuning.

0.5460PartNet mIoUHighest in the comparison
0.8471PartNet VoILower is better
0.75753DCoMPaT++ RIHighest in the comparison
0.57903DCoMPaT++ SCHighest in the comparison

Average partition quality

Each dataset is evaluated with four complementary partition metrics.

MethodmIoU ↑RI ↑VoI ↓SC ↑
MPS0.31690.52661.02130.5267
PartField0.52490.78771.08100.6502
P3-SAM0.48580.69661.22380.5833
SAMPart3D0.42290.69991.19960.5862
PriMAny0.24400.52312.65060.2476
RePart0.54600.79650.84710.6891

Metrics: mIoU measures part overlap, RI pairwise partition agreement, VoI partition information difference, and SC region covering. Results match the manuscript's average partition-quality table.

On 3DCoMPaT++, RePart's mIoU is below P3-SAM (0.4476 vs. 0.5003), while its RI and SC are higher than the compared methods. Transfer is therefore metric-dependent.

Category view

RePart mIoU by category group

Jointly fine-tuned policy; no 3DCoMPaT++ fine-tuning.

DatasetFurnitureContainersDaily-useAverage
PartNet0.42470.64560.54320.5460
3DCoMPaT++0.37030.51490.46070.4476

Qualitative results

From fragmented tokens to coherent parts

Examples from PartNet and 3DCoMPaT++ compare RePart with ground truth and five baseline methods.

Ten rows of segmented 3D objects. Columns show ground truth, MPS, PriMAny, PartField, P3-SAM, SAMPart3D, and RePart.
Five PartNet examples appear above five 3DCoMPaT++ examples. Click the expand button for a closer view.