通过匹配反向占位表面,实现几何部件的精准拼接。
Combinative Matching for Geometric Shape Assembly
- 基于表面形状相同、体积占位相反的特性建模匹配关系。
- 在基准测试中优于现有方法,显著减少匹配局部歧义。
- 适合需要高精度拼接的3D建模与机器人装配任务。
本文提出一种新的形状匹配方法——组合匹配(combinative matching),用于几何形状的拼装。传统方法依赖于部件间表面完全相同的对齐,而本方法明确建模两种互锁形状的特性:'表面形状一致'和'体积占位相反'。算法学习在表面形状相似但体积占据互逆空间的区域建立对应关系,并通过等变神经网络估计形状朝向,实现旋转对齐。该方法有效降低匹配过程中的局部歧义,提升拼装鲁棒性。在多个几何拼装基准测试中,本方法持续优于当前最优方法。项目页面:https://nahyuklee.github.io/cmnet。
原文摘要 · Abstract (English)
This paper introduces a new shape-matching methodology, combinative matching, to combine interlocking parts for geometric shape assembly. Previous methods for geometric assembly typically rely on aligning parts by finding identical surfaces between the parts as in conventional shape matching and registration. In contrast, we explicitly model two distinct properties of interlocking shapes: 'identical surface shape' and 'opposite volume occupancy.' Our method thus learns to establish correspondences across regions where their surface shapes appear identical but their volumes occupy the inverted space to each other. To facilitate this process, we also learn to align regions in rotation by estimating their shape orientations via equivariant neural networks. The proposed approach significantly reduces local ambiguities in matching and allows a robust combination of parts in assembly. Experimental results on geometric assembly benchmarks demonstrate the efficacy of our method, consistently outperforming the state of the art. Project page: https://nahyuklee.github.io/cmnet.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。