Magnet, RobinOvsjanikov, MaksMyszkowski, KarolNiessner, Matthias2023-05-032023-05-0320231467-8659https://doi.org/10.1111/cgf.14746https://diglib.eg.org:443/handle/10.1111/cgf14746We propose a new scalable version of the functional map pipeline that allows to efficiently compute correspondences between potentially very dense meshes. Unlike existing approaches that process dense meshes by relying on ad-hoc mesh simplification, we establish an integrated end-to-end pipeline with theoretical approximation analysis. In particular, our method overcomes the computational burden of both computing the basis, as well the functional and pointwise correspondence computation by approximating the functional spaces and the functional map itself. Errors in the approximations are controlled by theoretical upper bounds assessing the range of applicability of our pipeline.With this construction in hand, we propose a scalable practical algorithm and demonstrate results on dense meshes, which approximate those obtained by standard functional map algorithms at the fraction of the computation time. Moreover, our approach outperforms the standard acceleration procedures by a large margin, leading to accurate results even in challenging cases.CCS Concepts: Computing methodologies -> Shape analysis; Theory of computation -> Computational geometryComputing methodologiesShape analysisTheory of computationComputational geometry10.1111/cgf.1474689-10113 pages