用蒙特卡洛方法快速计算复杂3D网格的体积谱特征,提升几何处理鲁棒性。
Monte Carlo Steklov Operators for Large-Scale Geometry Processing in the Wild

- 将边界算子转化为随机过程估计,实现体积谱的高效计算
- 在45万张未清理的3D模型上完成内外部谱分析,速度比传统方法快数个量级
- 适用于低质量、多连通、高分辨率的现实场景3D数据,适合大规模学习
内在方法是网格几何处理的默认工具箱。特别是拉普拉斯算子这类内在算子,支撑了需保持等距不变性的形状分析、学习与编辑算法。然而,当处理真实世界中的几何数据时,这些方法的假设迅速失效:(i)网格质量不可靠,(ii)许多网格包含多个连通分量。此时,体积构造更具定义性,因可放宽曲面拓扑限制。本文提出一种蒙特卡洛方法,用于估计狄利克雷到诺伊曼(DtN)算子及其关联的斯蒂克洛夫本征模式。该方法基于近期蒙特卡洛几何处理进展,将边界算子本身作为估计对象。通过体积随机过程定义的DtN算子被推广至外部区域,使不连通组件通过周围空间耦合。实验表明,该方法在计算斯蒂克洛夫谱方面比现有边界元方法快数个量级,同时对劣质三角剖分、高分辨率网格和多组件几何具有鲁棒性。为验证可扩展性,我们在约45万张来自未清理的Objaverse数据集的形状上完成了内部与外部斯蒂克洛夫本征谱计算。我们将这些算子集成至Steklov-CLIP——一种基于体积谱算子的大规模对比3D表示学习神经网络。结果表明,该网络能学习语义上合理的全局与密集形状表示,说明几何合理性的体积算子可在现代3D数据规模下实用化。
原文摘要 · Abstract (English)
Intrinsic methods fill the default toolbox for geometry processing on meshes. Intrinsic operators, in particular the Laplacian, underlie methods that require invariance to isometry and have hence been employed in many algorithms for shape analysis, learning, and editing. However, intrinsic methods are predicated on assumptions that quickly become brittle when working with in-the-wild geometry, where (i) mesh quality is not guaranteed, and (ii) many meshes are modeled with multiple connected components. In such settings, volumetric constructions are better-defined, since restrictions on surface topology can be relaxed. This paper presents a Monte Carlo method for estimating the Dirichlet-to-Neumann (DtN) operator -- a boundary-to-boundary volumetric operator -- and its associated Steklov eigenmodes. We build on recent developments in Monte Carlo geometry processing by casting this boundary operator itself as the subject of estimation. The DtN operator, defined through a volumetric stochastic process, is then generalized to the exterior domain, where it couples disconnected components through the surrounding ambient space. We show that our method is orders of magnitude faster than existing boundary-element approaches for computing Steklov spectra while remaining robust to poor triangulations, high-resolution meshes, and multi-component geometry. To demonstrate this scalability, we compute interior and exterior Steklov eigenspectra for approximately 450,000 shapes from the uncurated Objaverse dataset. We incorporate these operators into Steklov-CLIP, a mesh-based neural network that uses volumetric spectral operators for large-scale contrastive 3D representation learning. The resulting network learns semantically meaningful global and dense shape representations, illustrating that geometrically-principled volumetric operators can be made practical at the scale of modern 3D datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。