← 返回时间线

paper

Fast Construction of Inner Sphere Trees Using Machine Learning

arXiv ↗
ID
2610.23940
分类
—
首次捕获
2026-10-20
状态
unread
作者
Jianneng Huang, Wenjia Rao
信号
SI 58

信号历史

  • 2026-10-20Scholar Inbox · 相关分 58
暂无信号数据

摘要

Collision detection for complex non-convex objects is a bottleneck in physics simulation, virtual reality, and robotics. Inner sphere trees (ISTs) answer proximity and penetration queries efficiently, but their greedy leaf-sphere construction is sequential and computationally expensive, which limits both large-scale preprocessing and runtime use. In this work, we present ML-IST, a machine-learning-based method that reformulates leaf-sphere generation as a single-shot set-prediction problem: a network predicts a fixed set of inscribed sphere candidates from multichannel voxel geometry, differentiable coverage feedback corrects the coarse prediction and fills residual gaps at finer scales, and a lightweight geometric projection enforces validity. Averaged over the test set, a single-GPU implementation of ML-IST reduces mean leaf-generation time by a factor of $2.0$--$2.6$ over single-core CPU construction across target capacities of 64--512 spheres, and qualitative results on complex models show multiscale sphere distributions that follow principal volumes and slender features. We further integrate ML-IST into the Jolt Physics and Bullet engines; in an alpha-puzzle benchmark it reaches 55.89~FPS, the highest among the compared representations (conventional IST, GImpact, and convex decomposition). These results support learned leaf generation as a practical component for fast, runtime construction of detailed collision representations.

我的笔记

还没有笔记。

在 GitHub 上写笔记 ↗(新建 content/notes/2610.23940.md,PR 合并后本页自动更新)