betaFeedback

WorksComputer Science

Spatial-Spectral Coupling as Attention: Scaling Shape Correspondence to High-Resolution Surfaces

Abstract

Establishing dense correspondence between high-resolution 3D shapes remains challenging due to the spatial–spectral coupling at the core of many functional-map methods, which grows quadratically with mesh resolution. We observe that this coupling is equivalent to a scaled dot-product attention formulation, with learned descriptors serving as queries and keys and spectral basis functions as values. This connection makes efficient attention implementations directly applicable to shape matching and an effective mechanism for scaling spatial-spectral coupling. We show that optimized quadratic attention implementations can scale modern deep functional map pipelines to large mesh sizes, improving both runtime and memory consumption, while sub-quadratic methods introduce errors, particularly for non-isometric shape pairs, where an exact coupling proves most necessary. These insights motivate Geo-FlashAttention, which restricts the exact softmax to geometry-selected surface patches and achieves near-linear empirical scaling while preserving correspondence accuracy of exact implementations. Across six standard benchmarks and three functional-map pipelines, rigorous analysis shows that efficient couplings preserve correspondence accuracy. At 60k60k vertices, these insights reduce peak training memory from 106.08 to 5.67,GiB, with Geo-FlashAttention being 1.5×1.5\times faster per training step than FlashAttention. This enables end-to-end learning for correspondence problems on large meshes such as cortical surfaces, where high resolution is required to preserve disease-relevant intricacies of the surface geometry. Project page available https://spatial-spectral-attention.github.io/

Introduction

Large-scale 3D meshes with tens of thousands of vertices are often required to represent whole-body avatars

or complex anatomical shapes, such as cortical surfaces (see Figure 1). Establishing fine-grained correspondences between such shapes is a crucial prerequisite for geometry-aware analysis and processing, enabling applications such as avatar animation [41], motion transfer [60], and shape editing [59] in computer graphics, as well as intersubject comparison of anatomical variability in biomedical imaging [5, 10, 29, 68]. In particular, accurate correspondences enable the transformation of information across shape instances, allowing local geometric and semantic attributes to be transferred, compared, and statistically analyzed despite substantial variability in shape, pose, or topology [23, 26]. Many recent advances in non-rigid shape matching build on the functional map framework [47], which avoids the combinatorial search over point-to-point maps by representing correspondence as a compact linear operator acting on a truncated Laplace–Beltrami eigenbasis [52]. Learning-based variants [20, 39] pair this formulation with intrinsic feature extractors [58] that learn descriptors in place of hand-crafted spectral signatures [4, 61], employing unsupervised structural or metric-preservation losses [30, 57].

Figure 1. Scalability challenges of Deep Spectral Methods. Spectral matching methods often rely on recovering a point-to-point map ΠNM\Pi_{NM}, either to convert a functional map back to the spatial domain or as an effective regularization. Comparing shape vertex features requires O(nM⋅nN)\mathcal{O}(n_M \cdot n_N) operations, which is infeasible with current strategies.

A dense point-to-point mapping can then be recovered from a functional map in a number of ways, for instance, by finding the nearest spectral embeddings of the source vertices on the target shape [73] or through refinement procedures [50, 55, 67]. Such spectral-to-spatial conversion is also an essential algorithmic component of numerous methods, providing structure for optimization in the ambient space for both axiomatic [46] and learned methods [12].

However, current approaches are not directly applicable in the high-resolution regime because the soft assignment manifests as a dense n×mn \times m similarity matrix between the vertices of the two shapes. Both the forward- and backward-pass require materialization of this matrix, so memory grows quadratically with mesh size: for two shapes with n=m=100kn = m = 100\mathrm{k} vertices, a single coupling already occupies roughly 40 GB in single precision. This limitation is particularly restrictive in domains where fine geometric detail is essential. For example, cortical surface analysis routinely employs meshes with more than 100k vertices per hemisphere [16, 28], and contemporary digital human avatars often require similarly high resolutions to faithfully capture anatomy and appearance. Consequently, most existing methods operate on heavily downsampled representations and then transfer predictions to the full-resolution mesh [42]. However, this introduces approximation errors and potentially discards fine-scale geometric information.

In this work, we revisit the coupling operation at the core of functional-map-based correspondence methods. We show that the spatial-spectral interaction underlying these models can be reformulated as scaled dot-product attention [65], revealing an unexpected connection between geometric correspondence learning and modern transformer architectures. Furthermore, we introduce Geo-FlashAttention, a geometry-aware sparse attention mechanism that exploits the local structure of surfaces to achieve near-linear scaling with mesh size, making end-to-end correspondence learning feasible on meshes that were previously beyond reach. Our main contributions are:

  • We show that the spatial–spectral coupling ΠΦM\Pi\Phi_M shared by coupled functional-map methods is exactly scaled dot-product attention, where the learned descriptors act as queries and keys, and the spectral basis as values.

  • This makes exact efficient-attention algorithms directly applicable. FlashAttention [17, 18] removes the O(nNnM)\mathcal{O}(n_N n_M) memory of the coupling, preserving the correspondence up to floating-point rounding.

  • We show that linearised (kernelised) couplings [15, 32] are, in contrast, a real approximation. They significantly compromise accuracy, which worsens with non-isometry.

  • We thus introduce Geo-FlashAttention, a block-sparse coupling that evaluates the exact softmax over surface-patch candidates, scales near-linearly, and enables training of coupled methods on high-resolution meshes.

  • This enables applications such as shape matching for cortical surfaces (over 100k vertices per hemisphere), where we show that, within the technical advances of our framework, existing functional-map methods can outperform state-of-the-art learned surface-reconstruction methods.

Related Work

Our approach draws on three distinct bodies of work: non-rigid shape correspondence, efficient attention, and cortical surface registration. We review each of these subfields, focusing on the functional-map coupling that connects scalable attention to high-resolution correspondence.

Shape correspondence and functional-map coupling. Dense correspondence between non-rigid 3D shapes has been addressed through numerous ways; we outline several trends here, but refer readers to recent surveys for a broader treatment [31, 73]. Classical approaches include minimum-distortion metric embedding [11], conformal alignment [33, 38], and kernel matching; in general, recovering a correspondence under non-isometric deformation while preserving pairwise geometric consistency amounts to an NP-hard quadratic assignment problem [66]. Combinatorial formulations that optimize directly over point-to-point maps [56, 69] provide optimality guarantees but struggle to scale due to this inherent complexity [27]. These families trade off accuracy, robustness to non-isometry, supervision requirements, and scalability.

Within this landscape, functional maps [47] are widely used for dense 3D shape correspondence, especially in unsupervised settings where annotations are difficult to obtain, such as anatomical data [5, 10, 26]. They represent correspondence as a compact linear operator between the eigenbases of two shapes, thereby providing strong structural priors. Because of this structure, the framework learns per-vertex descriptors directly from surface features, with supervision [39] or, later, without ground-truth correspondence [57].

The standard basis used is the intrinsic Laplace–Beltrami eigenbasis, though hybrid functional maps [6] extend it with an extrinsic elastic component to better handle non-isometric deformations. The spectral objective alone does not determine a meaningful pointwise map [62]. Since most applications ultimately require an explicit point-to-point correspondence, high accuracy relies on coupling the operator back to the spatial domain [12]. This coupling is realised either through a soft pointwise map Π=softmax⁡(FNFMT/τ)\Pi= \operatorname{softmax}(F_N F_M^{\mathsf{T}}/\tau) in learned pipelines [12] (Figure 2), or through iterative refinement such as ZoomOut [44, 46]. The resulting map Π∈RnN×nM\Pi\in\mathbb{R}^{n_N \times n_M} is dense, and its O(nNnM)O(n_N n_M) memory limits coupled methods to low-resolution meshes. Magnet and Ovsjanikov [43] scale the classical pipeline to dense meshes by approximating the functional spaces and the map itself through subsampling. For learned pipelines, [44] avoids the approximation altogether: only the projection ΠΦM\Pi\Phi_M is ever needed, and they compute it without materializing Π\Pi, using the symbolic kernel library KeOps [14] to evaluate the reduction on the fly. This removes the memory bottleneck but remains computationally expensive: every one of the nNnMn_N n_M pairwise terms is still evaluated, so the projection remains quadratic in time.

Spatial-spectral coupling common in functional map methods

Figure 2. Spatial-spectral coupling common in functional map methods [12]. Shared encoders extract feature descriptors of both shapes, which are used to construct functional and point-to-point maps coupled in an alignment regularization.

Efficient attention. Scaled dot-product attention [65] is a key building block of modern neural architectures, most apparent in large language models, which popularised it. Its cost grows quadratically with sequence length, and a large literature reduces this cost along three lines. Exact methods keep the softmax but never materialize the full attention matrix, computing the softmax-weighted reduction with hardware-aware tiling (e.g., FlashAttention [17, 18]). Approximate methods instead replace the softmax with a kernel feature map, reassociating the product into linear time and memory [15, 32]. A third line restricts each query to a subset of keys through local or block-sparse patterns, keeping the softmax exact over that reduced set while avoiding the quadratic cost of attending to all keys [7, 72]. However, these partitions are defined by sequence structure rather than by the geometry of the domain. Transformers have also been used for non-rigid point-cloud registration [64] and shape correspondence with positional encoding [49]. Riva et al. [53] replace some learned self-attention weights with localized Gaussians to improve training efficiency and correspondence quality. Attention also appears in functional-map methods, applied over descriptor features for partial shapes [3], or to combine multiple spectral resolutions [36]. These approaches use attention within correspondence architectures. We focus on the existing soft spatial–spectral projection and evaluate efficient attention kernels for this operation. Geo-FlashAttention selects geodesic patch support for the descriptor-based softmax, while the Gaussian weights of Riva et al. [53] define self-attention within a Transformer.

Registration of cortical surfaces. Establishing correspondences between cortical surfaces is a prerequisite for comparing brain anatomy across subjects and for the population-level analysis of biomarkers such as cortical thickness, which underpins the study of neurodegenerative diseases like Alzheimer’s [19]. Existing methods fall into three broad families. Spherical registration methods [54, 71] inflate each hemisphere to a sphere and align surfaces in this canonical domain; this is the strategy adopted by the widely used FreeSurfer pipeline [28]. While robust, the inflation step is computationally intensive and inevitably introduces metric distortions that propagate into the resulting correspondences. More recently, deformation-based methods [9] estimate correspondences by directly deforming surfaces in the ambient 3D space. Spectral approaches [40] instead match surfaces in a low-dimensional embedding derived from the Laplace–Beltrami operator, avoiding the spherical parameterization altogether, but modern feature correspondence methods cannot easily scale to the high resolution demanded by intricate cortical surfaces.

Background & Motivation

Functional Maps and Spectral Constraints

Functional maps provide a compact spectral representation for dense correspondences between 3D shapes. Given a source shape M\mathcal{M} with nMn_M vertices and a target shape N\mathcal{N} with nNn_N vertices, let ΦM∈RnM×k\Phi_M \in\mathbb{R}^{n_M \times k} and ΦN∈RnN×k\Phi_N \in\mathbb{R}^{n_N \times k} contain the first kk Laplace–Beltrami eigenfunctions of the respective shapes. A functional map CMN∈Rk×kC_{MN} \in\mathbb{R}^{k \times k} represents a linear correspondence between functions expressed in these spectral bases: for a function fM≈ΦMαf_M \approx\Phi_M \alpha on M\mathcal{M}, its corresponding function on N\mathcal{N} is represented as

fN≈ΦNCMNα.f_N \approx\Phi_N C_{MN}\alpha.

Restricting the representation to the first kk eigenfunctions yields a low-dimensional, band-limited approximation of the correspondence, with k≪nM,nNk \ll n_M, n_N. The functional representation is computationally attractive because the map CMNC_{MN} is of size k×kk \times k, and structural priors such as orthogonality, bijectivity, and Laplacian commutativity can be expressed as algebraic penalties in this basis.

Spatial-Spectral Coupling

Optimizing correspondence purely in the spectral domain can be insufficient, since the spectral training objective does not in general determine a meaningful pointwise correspondence. Sun et al. [62] illustrate this ambiguity with a degenerate solution in which the learned descriptor functions on each shape take the form Fi=ΦiA0F_i = \Phi_i A_0, for some fixed coefficient matrix A0A_0. Since the spectral descriptor coefficients are Ai=Φi†FiA_i = \Phi_i^\dagger F_i, this construction gives Ai=A0A_i = A_0 for every shape. Consequently, the identity functional map Cij=IC_{ij} = I satisfies the descriptor-preservation condition CijAi=AjC_{ij}A_i = A_j for every pair. Moreover, the identity map trivially satisfies orthogonality and bijectivity constraints. Thus, even a functional map that is optimal under standard spectral objectives need not yield a meaningful point-to-point correspondence.

This ambiguity motivates coupling the spectral representation back to a spatial correspondence. A discrete pointwise map ΠNM∈RnN×nM\Pi_{NM} \in\mathbb{R}^{n_N \times n_M} induces a functional map through the spatial-to-spectral projection

C~MN=ΦN†ΠNMΦM,(1)\widetilde{C}_{MN} = \Phi_N^\dagger\Pi_{NM}\Phi_M, \tag*{(1)}

where †\dagger denotes the mass-weighted left inverse. The set of functional maps arising from such pointwise correspondences was formalized by Ren et al. [51] as the space of proper functional maps. Enforcing consistency between a spectrally estimated functional map and one induced from a spatial correspondence provides a simple yet effective way to resolve ambiguities left by purely spectral objectives, and forms the basis of several subsequent functional-map methods [2, 6, 12, 44, 62].

For instance, the ULRSSM framework [12] enforces this consistency through an alignment loss. From learned per-vertex descriptors FM∈RnM×dF_M \in\mathbb{R}^{n_M \times d} and FN∈RnN×dF_N \in\mathbb{R}^{n_N \times d}, it constructs a soft pointwise correspondence

ΠNM=Softmax⁡(FNFMTτ).\Pi_{NM} = \operatorname{Softmax}\left(\frac{F_N F_M^\mathsf{T}}{\tau}\right).

Substituting this assignment into Eq. (1) gives the induced functional map, which is compared with the map obtained from the spectral solver branch. Their disagreement is penalized during training, encouraging the spectral solution to remain consistent with a spatially realized correspondence. Similarly, the ZoomOut algorithm [46] relies on the same spatial-to-spectral coupling, implementing it through iterative refinement. Starting from a functional map at spectral resolution kk, ZoomOut recovers a pointwise map and projects it back into a higher-dimensional basis containing the first k+Δkk+\Delta k eigenfunctions:

C(k+Δk)=(ΦN(k+Δk))†ΠNM(k)ΦM(k+Δk).C^{(k+\Delta k)} = \left(\Phi_N^{(k+\Delta k)}\right)^\dagger\Pi^{(k)}_{NM}\Phi_M^{(k+\Delta k)}.

Repeating this process ensures that the refined spectral maps are induced by explicit pointwise correspondences while progressively increasing the spectral resolution. Recent differentiable variants of ZoomOut [44] replace hard nearest-neighbor assignments with soft correspondences, making this spatial-spectral conversion differentiable and thus compatible with end-to-end training.

Scalability of Spatial–Spectral Coupling

The shared computational primitive in both learned functional-map pipelines and refinement methods is the pointwise-to-functional projection ΦN†ΠΦM\Phi_N^\dagger\Pi\Phi_M.

Its dominant cost is the intermediate product ΠΦM\Pi\Phi_M, where Π∈RnN×nM\Pi\in\mathbb{R}^{n_N \times n_M} is a dense soft correspondence and ΦM∈RnM×k\Phi_M \in\mathbb{R}^{n_M \times k} is a truncated spectral basis. Although Π\Pi contains nNnMn_N n_M pairwise correspondence weights, only the product ΠΦM\Pi\Phi_M is required to construct the induced functional map. The dense correspondence is therefore only an intermediate representation.

A naïve implementation nevertheless materializes Π\Pi, incurring O(nNnM)O(n_N n_M) memory and limiting applicability to high-resolution meshes. Magnet and Ovsjanikov [44] observed that this intermediate matrix can be avoided by computing the product ΠΦM\Pi\Phi_M directly, without explicitly constructing Π\Pi. This removes the need to store the dense feature assignment while preserving the resulting point map. Building on this observation, we show that for standard soft correspondences, this reduction can be written as scaled dot-product attention, up to the choice of scale.

This allows the spatial-to-spectral projection to be evaluated with highly optimized exact attention kernels, connecting spatial-spectral coupling to efficient attention methods developed for scaling transformers.

Spatial–Spectral Coupling as Attention

The coupling in Eq. (1) requires only the product ΠNMΦM\Pi_{NM}\Phi_M. For the descriptor-based soft assignment, this is

ΠNMΦM=Softmax⁡(FNFMTτ)ΦM.\Pi_{NM}\Phi_M = \operatorname{Softmax}\left(\frac{F_NF_M^{\mathsf T}}{\tau}\right)\Phi_M.

We observe that this formulation can be written as Scaled Dot-Product Attention (SDPA), with scale 1/τ1/\tau in place of the usual 1/d1/\sqrt{d}, under the identification

Q=FN,K=FM,V=ΦM.Q = F_N,\qquad K = F_M,\qquad V = \Phi_M.

The learned shape descriptors (QQ, KK) determine the correspondence weights (the attention matrix), while the values (VV) are the spectral basis functions being transported through that correspondence.

This reformulation makes optimized attention variants directly applicable to spatial-spectral shape matching. In particular, we utilize FlashAttention [17, 18], which computes the exact softmax-weighted reduction using hardware-aware tiling, avoiding the explicit materialization of the nN×nMn_N \times n_M attention matrix. This reduces the memory complexity of the coupling layer from O(nNnM)O(n_Nn_M) to O(nN+nM)O(n_N+n_M), enabling training on high-resolution meshes.

Approximate Spatial–Spectral Projection

Linear Attention. FlashAttention removes the quadratic memory requirement, but exact attention still has quadratic time complexity. Linear attention [32] instead replaces the exponential kernel by a non-negative feature map φ:Rd→Rr\varphi:\mathbb{R}^{d}\to\mathbb{R}^{r} reassociating the product into linear time and memory:

LinAttn⁡(Q,K,V)i=φ(qi)T∑j=1nMφ(kj)vjφ(qi)T∑j=1nMφ(kj).(2)\operatorname{LinAttn}(Q,K,V)_i = \frac{\varphi(q_i)^{\mathsf T}\sum_{j=1}^{n_M}\varphi(k_j)v_j} {\varphi(q_i)^{\mathsf T}\sum_{j=1}^{n_M}\varphi(k_j)}. \tag*{(2)}

The standard choice φ(x)=ELU⁡(x)+1\varphi(x)=\operatorname{ELU}(x)+1 is far too diffuse to approximate the sharply peaked coupling in Eq. (1), so we sharpen it with a temperature-matched polynomial factor, φ(x)ℓ=(ELU⁡(xℓ)+1)(1+∣xℓ∣/τ)p\varphi(x)_\ell=(\operatorname{ELU}(x_\ell)+1)(1+|x_\ell|/\tau)^p with r=dr=d, and additionally evaluate Performer’s random-feature softmax estimator [15]. Regardless of the map, the factorized kernel φ(Q)φ(K)T\varphi(Q)\varphi(K)^{\mathsf T} has rank at most rr. We observe empirically that accurate correspondence estimation requires the soft vertex assignment to be near-full rank (§ 8.1). Linearized couplings are therefore lossy at practical feature dimensions, motivating a sparse alternative.

Geo-FlashAttention

Let xiN∈R3x_i^N\in\mathbb{R}^3 denote the position of target vertex ii on shape N\mathcal{N}, with normalized query qiq_i given by the corresponding row of Q=FNQ=F_N. Similarly, xjMx_j^M and kjk_j denote a source vertex position and its normalized key from K=FMK=F_M. Using geodesic distances on the mesh, we independently partition the target vertex-index set IN={1,…,nN}\mathcal{I}_N=\{1,\ldots,n_N\} and source vertex-index set IM={1,…,nM}\mathcal{I}_M=\{1,\ldots,n_M\} into patch collections A\mathcal{A} and B\mathcal{B}, respectively (Figure 3),

Overview of Geo-FlashAttention

Figure 3. Overview of Geo-FlashAttention. (1) Target N\mathcal{N} and source M\mathcal{M} are partitioned into geometrically derived patches A\mathcal{A} and B\mathcal{B} based on vertex positions. (2) Each source patch BrB_r is summarised by its mean key μr\mu_r. (3) Target queries are scored against the pooled keys and reduced per patch pair by sar=max⁡i∈AaqiTμrs_{ar} = \max_{i\in A_a} q_i^\mathsf{T}\mu_r. (4) The RR best-scoring source patches per target patch form the support Sa,RS_{a,R}, so every row keeps exactly RR patches. (5) A fused block-sparse kernel evaluates the exact softmax without materialising Π~NM(R)\widetilde{\Pi}^{(R)}_{NM}.

IN=⨆Aa∈AAa,IM=⨆Br∈BBr.(3)\mathcal{I}_N=\bigsqcup_{A_a\in\mathcal{A}}A_a,\qquad \mathcal{I}_M=\bigsqcup_{B_r\in\mathcal{B}}B_r. \tag*{(3)}

We use geodesic farthest-point-sampled centers, followed by geodesic nearest-center assignment, and add centers to split oversized patches. For each source patch BrB_r, define its mean key

μr=1∣Br∣∑j∈Brkj.(4)\mu_r=\frac{1}{|B_r|}\sum_{j\in B_r}k_j. \tag*{(4)}

A target patch AaA_a scores source patch BrB_r by

sar=max⁡i∈AaqiTμr.(5)s_{ar}=\max_{i\in A_a}q_i^{\mathsf T}\mu_r. \tag*{(5)}

Let Sa,R\mathcal{S}_{a,R} contain the indices of the RR largest scores. For i∈Aai\in A_a, define χij(R)=1\chi_{ij}^{(R)}=1 if j∈⋃r∈Sa,RBrj\in\bigcup_{r\in\mathcal{S}_{a,R}}B_r, and 00 otherwise. We define geometric attention as the soft assignment restricted to this support:

Π~NM,ij(R)=χij(R)exp⁡(qiTkj/τ)∑ℓ=1nMχiℓ(R)exp⁡(qiTkℓ/τ).(6)\widetilde{\Pi}_{NM,ij}^{(R)} = \frac{\chi_{ij}^{(R)}\exp(q_i^{\mathsf T}k_j/\tau)} {\sum_{\ell=1}^{n_M}\chi_{i\ell}^{(R)}\exp(q_i^{\mathsf T}k_\ell/\tau)}. \tag*{(6)}

The normalized descriptors score target–source patch pairs. Based on these scores, the top RR source patches for each target patch are selected, defining the weights within that support. Once the support is fixed, Eq. (6) is the exact softmax on the selected vertices. Geo-FlashAttention evaluates the resulting block-sparse product Π~NM(R)ΦM\widetilde{\Pi}_{NM}^{(R)}\Phi_M directly, replacing the dense product in Eq. (1) without materializing the approximate soft correspondence matrix Π~NM(R)\widetilde{\Pi}_{NM}^{(R)}.

If every source patch contains at most mmax⁡m_{\max} vertices, each target row attends to at most Rmmax⁡Rm_{\max} source vertices. The restricted attention stage therefore costs O(nNRmmax⁡(d+k))O(n_N Rm_{\max}(d + k)), while the coarse selection costs O(nN∣B∣d)O(n_N |B|d). Figure 4 depicts the coupling computations.

Figure 4. Comparing attention computations. (1) Dense softmax forms the full nN×nMn_N \times n_M correspondence matrix, while FlashAttention (2) tiles AA through on-chip memory. (3) Linear attention replaces the softmax kernel by a feature map φ\varphi approximating the product. (4) Geo-FlashAttention evaluates exact softmax attention on the induced vertex support by SS.

Results

Overview. We implement our framework using the DeepShapeMatchingKit [70], which provides the core PyTorch codebase for our training and evaluation pipelines. For consistency, all reported timing and peak-memory measurements are taken on a single, exclusively allocated H200 NVL with 140 GB of VRAM.

All coupling variants use a shared training framework and, within each experiment, receive identical inputs and scales; only the evaluation of ΠΦ\Pi\Phi changes. The dense and linearized variants use PyTorch tensor operations, KeOps [14] uses its symbolic reduction, the fp32 SDPA and FlashAttention variants use PyTorch’s SDPA interface, and Geo-FlashAttention uses a custom-implemented Triton kernel [63]. Precisions and backend-specific settings are detailed in Sec. 7.2. For runtime and memory comparisons, we warm up each backend, synchronize CUDA and clear memory between runs, and run the backends back-to-back.

We evaluate on complementary benchmarks spanning near-isometric to strongly non-isometric matching. For near-isometric matching, we use the FAUST [8] dataset, a standard benchmark containing human shapes in various poses, together with SCAPE [1] and the more challenging SHREC’19 [45]. To assess performance under large non-isometric deformations, we evaluate on the SMAL dataset [74], which contains highly varied quadruped animals across different species, and on DeformingThings4D [37] in both its intra- and inter-class settings. Finally, we use the released TOPKIDS [35] meshes (with ≈8\approx8–1212k and ∼60\sim60k vertices) to evaluate robustness to topological noise and to demonstrate our method’s memory efficiency.

We report the mean and standard deviation over pre-declared random seeds. Unless noted otherwise, each configuration uses five seeds.

Equivalence on Standard Benchmarks

Setup. We first assess whether the dense coupling can be replaced within standard evaluation protocols from the literature [6, 12, 20]. Each benchmark is trained and evaluated using its established training and validation sets. Within each method block of Table 1 we only vary the point-to-point coupling described in § 4, keeping the model, data, and protocol fixed. We report the mean and standard deviation for each setting3.

MethodCouplingFAUSTSCAPESHREC’19SMALDT4D-intraDT4D-inter
Iterative refinement
ZoomOut [44, 46]Dense1.79 ± 0.004.33 ± 1.386.17 ± 0.1323.48 ± 3.721.94 ± 0.045.17 ± 0.18
FlashAttention1.79 ± 0.004.18 ± 1.535.70 ± 0.6725.51 ± 2.811.87 ± 0.155.13 ± 0.15
Geo-FlashAttention1.80 ± 0.014.48 ± 2.115.71 ± 0.2424.29 ± 1.732.03 ± 0.256.48 ± 2.18
Learned pipelines
ULRSSM [12]Dense1.56 ± 0.041.87 ± 0.024.45 ± 0.984.14 ± 0.350.96 ± 0.054.12 ± 0.33
FlashAttention1.58 ± 0.011.88 ± 0.024.29 ± 0.294.01 ± 0.261.00 ± 0.084.01 ± 0.49
Geo-FlashAttention1.57 ± 0.041.87 ± 0.014.65 ± 0.584.08 ± 0.330.93 ± 0.023.78 ± 0.10
HybridFMaps [6]Dense1.36 ± 0.011.79 ± 0.033.94 ± 0.623.68 ± 0.110.96 ± 0.033.49 ± 0.05
FlashAttention1.37 ± 0.011.78 ± 0.023.57 ± 0.413.62 ± 0.201.00 ± 0.033.47 ± 0.16
Geo-FlashAttention1.37 ± 0.001.75 ± 0.004.20 ± 0.833.41 ± 0.271.03 ± 0.023.48 ± 0.03

Table 1. Correspondence accuracy of feature couplings, as mean geodesic error (×100\times100, ↓\downarrow) over three seeds ±\pm standard deviation. Within each method block, only the computation of ΠΦ\Pi\Phi changes. Learned-pipeline rows differ due to coupling and optimization convergence. We run Bonferroni-corrected simultaneous 95% Welch confidence intervals for mean differences from dense runs, for which no statistically significant differences are detected (they all include zero). Our proposed couplings are in bold.

Results. Across ULRSSM, HFM, and ZoomOut, we observe no systematic difference in correspondence accuracy between the alternative and dense couplings on the tested benchmarks. The differences in mean error vary in direction across methods and benchmarks, and are generally small relative to the observed seed variability. These results support comparable observed accuracy across model families.

Accuracy–Efficiency Trade-offs

Setup. The standard shape-matching benchmarks contain only 5–8k vertices [20]. At this scale, the coupling only accounts for a small fraction of a training step. We therefore assess scalability of ULRSSM [12] on the two datasets released with the TOPKIDS benchmark [35], using both original (≈\approx 8–12k vertices) and the high-resolution (≈\approx 60k) meshes, 26 unit-area meshes each. Table 2 reports training-step time, peak memory, and geodesic error.

CouplingTOPKIDS (≈\approx 8–12k vertices) Time (ms) ↓\downarrowTOPKIDS (≈\approx 8–12k vertices) Peak mem. (GiB) ↓\downarrowTOPKIDS (≈\approx 8–12k vertices) Geo. err. ↓\downarrowTOPKIDS-HD (≈\approx 60k vertices) Time (ms) ↓\downarrowTOPKIDS-HD (≈\approx 60k vertices) Peak mem. (GiB) ↓\downarrowTOPKIDS-HD (≈\approx 60k vertices) Geo. err. ↓\downarrow
Exact couplings
Dense (fp32)66.0 ± 7.95.2216.55 ± 6.84 (5.92)710.6 ± 105.6106.08OOM†
KeOps (fp32) [44]1943.2 ± 7.01.23−38285.9 ± 115.55.67Unsched.*
SDPA (fp32)78.9 ± 5.21.2319.35 ± 7.41 (8.43)861.5 ± 5.05.6711.05 ± 1.69 (8.83)
FlashAttention (bf16)46.4 ± 0.31.2315.65 ± 6.52 (9.08)207.2 ± 5.05.6711.38 ± 3.11 (7.02)
Approximate couplings
Performer44.4 ± 1.81.2337.06 ± 1.68 (34.89)109.7 ± 4.85.6737.73 ± 1.24 (36.39)
Linear attention (ELU)43.5 ± 1.81.2335.10 ± 1.87 (32.70)108.4 ± 4.95.6730.60 ± 0.91 (29.31)
Geo-FlashAttention (ours)52.3 ± 2.01.2313.30 ± 7.51 (7.25)136.2 ± 4.65.678.79 ± 1.28 (6.97)

Table 2. Cost and accuracy of ULRSSM [12] couplings on the two released TOPKIDS datasets [35]. Time and peak memory are for one training step at ≈\approx 12k and ≈\approx 60k, mean ± standard deviation over five repeats; geodesic error (×100) uses 25 test pairs of the released datasets, mean ± standard deviation over fixed seeds with the best seed in parentheses (seed counts and protocol: § 7.1). ∗Unschedulable: 29.9 days for one 100-epoch run. †Dense training at 60k exceeds 140 GB; 106.08 GiB is one iteration.

Results. At 12k, training-step times other than KeOps span 1.8×, and every non-dense method uses 1.23 GiB. At 60k, the corresponding time range increases to 7.9×; dense attention requires 106.08 GiB, whereas every non-dense method uses 5.67 GiB. FlashAttention is the fastest feasible exact coupling. Because its kernel is available only in half precision, fp32 SDPA dispatches to the memory-efficient kernel [48] and is 4.2× slower at 60k. The measured KeOps [44] step time would yield approximately one month for a complete run. This is due to the constant overhead of symbolic reduction, because KeOps materializes a general-purpose fp32 kernel much slower than tuned attention kernels, and forming gradients re-evaluates the un-stored reduction, increasing its relative cost in training.

Finally, we fit y=cNay=cN^{a} over seven decimated resolutions from 5k to 60k vertices, yielding isolated empirically estimated scaling exponents of a=1.97a=1.97 for dense attention, 1.83 for FlashAttention, and 0.81 for Geo-FlashAttention. The performance crossover is near 20k vertices, which is far below cortical resolution. In Sec. 8.2} we report the fitting protocol, the full-step exponents, and the complete runtime and memory curves. On the released low-resolution benchmark, the best fixed seed attains the published ULRSSM value of 9.2 for every exact coupling (5.9–9.1) and for Geo-FlashAttention (7.3), while both linearized couplings stay far above it (32.7 at best). At both resolutions, Geo-

FlashAttention achieves accuracy comparable to exact couplings and substantially lower error than linearized methods. Variability over seeds is reported in § 7.1.

Linearized couplings. FlashAttention and fp32 SDPA are exact kernels and change only the arithmetic, whereas linear attention replaces the softmax kernel with an approximation, and thus changes the correspondence itself. Measured against the dense reference over five seeds, ELU is significantly worse on four of the six benchmarks and Performer on five, the largest differences occurring on the strongly non-isometric SMAL and DTD4D-inter, consistent with the difficulty of representing a sharply peaked coupling with the low-rank feature maps discussed in § 4. In § 8.1} we report errors per benchmark and significance levels, and in Sec. 8.3} we examine the sharpness that causes this result.

Approximate couplings can act as regularization. A reduced point-to-point coupling can, in some cases, achieve more than merely approximating its dense counterpart. Because each query patch distributes its correspondence mass over a small candidate set rather than over the whole surface § 7.2, implausible correspondences receive exactly zero weight during training, and the restriction can act as a regularizer when the input geometry is unreliable. We evaluate this on the TOPKIDS benchmark (≈8\approx8–12k vertices), where one reference mesh is matched against 25 scans of children, with their surfaces merged at points of self-contact, thereby probing robustness to topological noise rather than deformation. Table 3 compares HFM with Geo-FlashAttention against published results. With Euclidean patches, HFM reaches 3.9, below both reported values for dense-coupled HFM (5.0 and 4.6). § 8.5 shows how Euclidean patches join surfaces in self-contact.

MethodGeo. err. ↓\downarrow
ZoomOut [46]33.7
AttentiveFMmaps [36]23.4
Deep Shells [25]13.7
Smooth Shells [24]10.8
ULRSSM [12]9.2
Synchronous Diffusion [13]5.4
HFM [6, 70]4.6
HFM + Geo-FlashAttention (ours)3.9

Table 3. Topological noise. Mean geodesic error (×100) on the released TOPKIDS benchmark [35], over its 25 test pairs at their released resolution (≈\approx 8–12k) and following existing protocols [6, 12]. Published rows are quoted as reported. GeoFA uses Euclidean patches with an error of 4.33 ± 0.42 over three seeds.

Cortical Surface Matching

Representing the human cortical surface at its native reconstruction resolution requires more than 100k vertices per hemisphere [16, 28]. At this resolution, dense coupling exceeds practical memory limits (Table 2), whereas FlashAttention permits functional-map training on cortical surfaces.

Setup. Mindboggle-101 [34] is the largest set of manually corrected human brain surfaces, providing 101 subjects with a DKT31 cortical parcellation each. We focus on the right-hemisphere white surfaces consisting of 122–166k vertices at native resolution and train on 91×90=8,19091 \times90 = 8{,}190 mesh pairs derived from 91 distinct subjects. The evaluation is performed on the remaining ten validation subjects. We run ULRSSM [12] coupled by Geo-FlashAttention (RR=64), using WKS [4] and anatomical features as input (see § 7.3).

Baselines. FreeSurfer [28] inflates each hemisphere to a sphere and registers it to a folding-based atlas. Fast Brain Matching [40] (FBM) is the classical spectral correspondence, taken in its geometry-only configuration with no anatomical features. V2C-Flow [9] deforms the FsAverage template to each subject, so correspondence follows from the shared template topology. § 7.3 gives each configuration and how each map is transferred to our meshes.

Metrics. Cortical surfaces lack ground-truth dense correspondence, so the geodesic error of Table 1 is unavailable. We therefore transfer the manually corrected DKT31 parcellation [34] (31 regions per hemisphere, delineated along folding landmarks) through each map, reporting vertex accuracy and region-averaged IoU (Table 4). Because those labels were FreeSurfer-initialized before manual correction, agreement with FreeSurfer’s own parcellation is partly built into the reference, so we add a label-free score. We subdivide M\mathcal{M} into SS geodesic Voronoi regions, assign each vertex of M\mathcal{M} to the region containing its IDNM\mathrm{ID}_{\mathrm{NM}}-image, and report the mean absolute log-area ratio Darea(S)=∣S∣−1∑s∈S∣log⁡(asM/asN)∣D_{\mathrm{area}}(S) = |S|^{-1}\sum_{s\in S}|\log(a_s^{\mathcal{M}}/a_s^{\mathcal{N}})| over the regions SS non-empty on both surfaces, where asMa_s^{\mathcal{M}} and asNa_s^{\mathcal{N}} are region and preimage areas divided by their native surface’s total area. It is zero for a locally area-preserving map and grows with stretching or compression. § 7.3 gives the construction in full.

MethodLabel transfer mIoU ↑Label transfer Acc. ↑Darea↓D_{\mathrm{area}} \downarrow by regions SS: 10Darea↓D_{\mathrm{area}} \downarrow by regions SS: 40Darea↓D_{\mathrm{area}} \downarrow by regions SS: 200
FreeSurfer* [28]0.7180.8510.06010.11290.1772
FBM [40]0.6190.7950.03670.07830.2394
V2C-Flow [9]0.5680.7530.08230.11920.2085
ULRSSM [12] + Geo-FlashAttention0.6330.8000.01840.03250.0706

Table 4. Label transfer and area distortion on cortical surfaces, averaged over 90 validation pairs of the Mindboggle dataset. Left: manually corrected DKT31 parcellations as preserved by each map. Right: Darea(S)D_{\mathrm{area}}(S), a map distortion measure. SS is the number of geodesic-Voronoi regions, and DareaD_{\mathrm{area}} growing with SS. For Geo-FA, we report the mean over three seeds. All methods are run under identical settings. *FreeSurfer [28] generated the reference labels prior to manual correction, so it is expected to score strongly on label transfer while confounding the evaluation w.r.t. parcelation labels.

Results. Our model attains the lowest area distortion at every scale (Table 4), between 49.8% and 60.1% below the best baseline. On label transfer, it ranks second on both scores, ahead of V2C-Flow and FBM but behind FreeSurfer, which is used to generate the reference labels and is therefore favored by that metric. DareaD_{\mathrm{area}} scores only the correspondence map. Figure 5 shows the transferred cortical labels and local disagreements with the target reference in two zoomed regions.

Figure 5. Label transfer between two held-out Mindboggle-101 subjects (lateral pial view). Source DKT31 labels are transferred to the target. Disagreements with the target’s manually corrected labels are highlighted in red. Zoomed regions are depicted in numbered boxes. Percentages give vertex accuracy between the pairs. *Reference labels were initialized with FreeSurfer before manual correction.

Conclusion, Limitations & Future Work

We identify spatial–spectral coupling as an attention operation, allowing efficient kernels to scale functional-map pipelines without sacrificing accuracy. Building on this simple yet effective insight, the proposed Geo-FlashAttention demonstrates that geometry-aware sparsification is better suited than linearization, enabling correspondence learning on substantially larger meshes.

Limitations and Future Work. Our reformulation applies only when the correspondence is consumed through a matrix product. Geo-FlashAttention additionally depends on a fixed candidate budget and lacks approximation guarantees. We measure scaling empirically. Moreover, evaluation on cortical surfaces is limited by the absence of dense ground truth. Adaptive candidate selection and stronger evaluation protocols are promising future directions.

Acknowledgements. The authors are grateful to the TU Munich Data Innovation Lab, which generously hosted this project. LB was supported by the UK Royal Society through grant NIF/R1/254128. The authors declare no conflicts of interest.

Supplementary Material

We organize the supplementary materials as follows. § 7.1 describes our evaluation protocol for comparison of attention kernels. § 7.2 lists the software, backends, architectures, losses, and learning rate schedules. § 7.3 provides the Mindboggle-101 evaluation protocol, configurations and the label-transfer metric behind Table 4. § 8.1 quantifies what the linearized couplings cost in accuracy and coupling rank. In § 8.2, we assess scaling characteristics of the different couplings across seven decimated TOPKIDS resolutions. In § 8.3, we analyze whether the fixed softmax temperature of linear attention variants is optimal and whether it can be learned. § 8.4 shows qualitative transfers across spatial–spectral couplings and cortical correspondence methods. § 8.5 assesses the Euclidean patch construction against an improved geodesic patch variant it approximates. In § 8.6 we sweep the candidate budget RR across benchmarks. § 8.7 presents the geodesic error distributions for Table 1 and Table S3.

BenchmarkDense (reference)Linear attention ELULinear attention Performer
FAUST1.56±0.041.56 \pm0.041.55±0.011.55 \pm0.011.93±0.13∗∗∗1.93 \pm0.13^{***}
SCAPE1.87±0.021.87 \pm0.021.99±0.06∗∗1.99 \pm0.06^{**}2.47±0.10∗∗∗2.47 \pm0.10^{***}
SHREC’194.45±0.984.45 \pm0.984.97±0.464.97 \pm0.465.64±1.425.64 \pm1.42
SMAL4.14±0.354.14 \pm0.355.54±0.48∗∗∗5.54 \pm0.48^{***}6.85±1.15∗∗∗6.85 \pm1.15^{***}
DT4D-intra0.96±0.050.96 \pm0.051.12±0.08∗∗1.12 \pm0.08^{**}1.29±0.12∗∗∗1.29 \pm0.12^{***}
DT4D-inter4.12±0.334.12 \pm0.336.35±0.89∗∗∗6.35 \pm0.89^{***}9.37±1.06∗∗∗9.37 \pm1.06^{***}

Table S3. Cost of linearized couplings. Mean geodesic error (×100\times100, ↓\downarrow); unlike Table 1, these approximate the softmax kernel and change the correspondence. Markers: two-sample tt-test against the dense reference over five seeds, ∗p<0.05^*p < 0.05, ∗∗p<0.01^{**}p < 0.01, ∗∗∗p<0.001^{***}p < 0.001.

Evaluation and Implementation Details

Evaluation Protocol

Seeds and statistics. The deep functional maps (DFM) literature commonly reports the best of NN runs. As we seek to distinguish between computational modules and their effect in various algorithms, we instead report the mean and standard deviation over five pre-declared seeds unless noted otherwise. We observe that SGD optimization in the deep variants sometimes converges to discontinuous part-exchanging maps despite comparable training objectives (Figure S1), a known failure mode of DFM methods [21, 22]. On SMAL and DT4D-inter this variability is concentrated in pairs containing one bistable shape, horse_05 and GoalkeeperScoop, respectively, and occurs across couplings rather than identifying a particular kernel. Excluding these pairs reduces the errors of the learned methods, making their behavior more predictable and enabling easier comparison between runs. We thus apply this exclusion identically to every row to separate the kernel comparison from the finite-seed flip draw, and report the all-pairs values alongside them in Table S1. SHREC’19 likewise contains visibly bistable shapes, but in the main-table results, we retain all shape pairs as the variance is generally high. Separately, one isolated ULRSSM dense seed on SMAL was replaced under a pre-declared, label-free within-arm rule: its closest-peer map disagreement exceeded 1.4×1.4\times the arm median.

Source, clean map, and flipped map showing a seed-dependent flip on a SHREC’19 shape

Figure S1. Seed-dependent flip on SHREC’19 shape 28. The source is coloured by signed lateral coordinate and pulled through the predicted map. One seed preserves the sides, while another exchanges them over the upper body.

MethodCouplingSMALDT4D-inter
ZoomOutDense23.23 ± 4.028.03 ± 2.49
FlashAttention25.37 ± 2.919.25 ± 2.32
Geo-FlashAttention24.20 ± 1.9511.22 ± 0.85
ULRSSMDense5.12 ± 0.704.49 ± 0.29
FlashAttention4.64 ± 0.696.17 ± 2.26
Geo-FlashAttention5.43 ± 0.575.00 ± 1.96
Linear (ELU)6.82 ± 0.878.19 ± 1.43
Performer7.54 ± 1.2610.94 ± 0.97
HFMDense4.07 ± 0.703.72 ± 0.11
FlashAttention3.98 ± 0.443.72 ± 0.16
Geo-FlashAttention3.62 ± 0.243.67 ± 0.02

Table S1. All-pairs results. Mean geodesic error (×100\times100, ↓\downarrow) including the bistable pairs omitted from the corresponding SMAL and DT4D-inter cells of Table 1 and Table S3. The exclusion consistently improves the mean across learned pipelines. It does not improve ZoomOut on SMAL, whose errors are distributed broadly rather than concentrated on the bistable pairs.

TOPKIDS. TOPKIDS has no bistable shape, so no pairs are excluded there: Table 2 reports all 25 test pairs. On the re-leased benchmarks every coupling uses the same five seeds.

Implementation Details and Hyperparameters

Software and exact backends. We use PyTorch 2.3.0 with CUDA 12.1. KeOps evaluates the same sum-softmax-weight reduction as an fp32 LazyTensor, per the authors’ original implementation. fp32 SDPA and bf16 FlashAttention utilize PyTorch’s scaled dot-product attention interface.

Linearized backends. Performer uses 256 orthogonal random features in fp32, with the projection fixed by seed 42 across runs. Linear attention uses the amplified ELU feature map of § 4 with polynomial amplification p=5p=5.

BenchmarkULRSSM / HFM pairsepochsitersTTAdiff. ZoomOut pairsiters
FAUST6 4001596 00003 16031 600
SCAPE2 6013078 03001 27512 750
SHREC’199 0011090 010124 43544 350
SMAL8412016 820154064 060
DT4D-H8 8791088 7900 / 158 70287 020
TOPKIDS67610067 60015——

Table S2. Training schedule per benchmark, batch size one. SHREC’19 trains on FAUST and SCAPE; one DT4D training serves the intra- and inter-class evaluations (0 and 15 test-time adaptation (TTA) steps). Differentiable ZoomOut trains ten epochs everywhere, with no TTA beyond its ten refinement iterations, and is not run on TOPKIDS.

Differentiable ZoomOut. ZoomOut is a standard refinement procedure, but in the differentiable variant the descriptors it refines are learned. We use ten refinement iterations, growing the spectral dimension from 20 to 120 in steps of 10, with blur σ=10−2\sigma=10^{-2} normalized by the maximum pairwise feature distance. It uses 128 eigenfunctions and a DiffusionNet of width 256 with four blocks, no dropout and a 32-dimensional output, trained with Adam at 10−410^{-4}, β=(0.9,0.99)\beta=(0.9, 0.99) and no weight decay, the learning rate dropping tenfold after the fifth of ten epochs. Its loss is the unweighted sum of three terms: the orthogonality defect of the initial 20×2020 \times20 map, that of the refined 120×120120 \times120 map, and the disagreement between the initial map and the leading 20×2020 \times20 block of the refined one, which is detached. Each term is normalized by 100/k2100/k^2 for a given kk. We keep ZoomOut’s Gaussian coupling Softmax⁡(−∥q−k∥2/(2σ2))\operatorname{Softmax}(-\lVert q-k\rVert^2/(2\sigma^2)). To run it through the attention backends, we augment the queries and keys so that the negative squared distance is equivalent to a dot product. Exact SDPA then evaluates the same Gaussian weights, and Geo-FlashAttention restricts them to its sparse support.

Training. We use the standard implementations provided by DeepShapeMatchingKit [70]. ULRSSM and HFM use a DiffusionNet [58] with width 128, four blocks, and dropout, which maps 128-dimensional auto-scaled WKS channels (raw, augmented vertex coordinates on SMAL, as in the reference implementation) to 256-dimensional descriptors. Both the WKS descriptors and DiffusionNet’s spectral diffusion use the first 128 Laplace–Beltrami eigenpairs, while the functional map is solved at 200 eigenfunctions on every benchmark. Optimizer settings are as follows: we use Adam at learning rate 10−310^{-3}, with the default β=(0.9,0.999)\beta=(0.9, 0.999) and no weight decay, cosine-annealed to 10−410^{-4} over the run without warmup, on one pair per step.

Cortical Evaluation Details

Dataset and surfaces. Mindboggle-101 pools 101 T1-weighted MRI scans from several collections, so acquisition site and protocol vary across the set. The white and pial surfaces are FreeSurfer reconstructions [28], and the DKT31 labels were produced by FreeSurfer’s automated parcellation and then corrected by hand [34]. Every method uses the same FreeSurfer reconstructions, except V2C-Flow, which is itself a reconstruction tool. The ten held-out subjects yield 90 shape pairs, with each subject in 18 of them.

Configurations. For our comparison in Table 4 we use ULRSSM [12] with 200 Laplace–Beltrami eigenfunctions and a DiffusionNet extractor on 134 anatomical channels (WKS, curvature, FreeSurfer sulcal depth, and cortical thickness), coupled by geodesic Geo-FlashAttention (R=64R=64) at τ=0.07\tau=0.07, averaged over three seeds. Each run is scheduled for three epochs (24 570 pairs). Validation runs every 500 iterations on the ten held-out subjects, scoring the parcellation Jaccard of the transferred labels. Early stopping is conducted with a patience of 25. We evaluate these final checkpoints on the same validation subjects. Among the baselines, FreeSurfer [28] matches vertices on the registered sphere, selecting the source vertex with the largest barycentric weight. FBM [40] uses K=50K=50 graph-Laplacian eigenvectors and no anatomical features; and V2C-Flow [9] deforms the 163,842-vertex FsAverage template, and its correspondence is transferred to our meshes by nearest-neighbor lookup.

Label transfer. The Desikan–Killiany–Tourville protocol assigns each vertex to one of 31 cortical regions per hemisphere, delineated along folding landmarks [34]. Accuracy is the fraction of vertices whose transferred label matches the manual one. mIoU intersects the transferred and manual vertex sets for each region and averages them across regions, so small and large regions count equally. Because the labels were FreeSurfer-initialized before manual correction, agreement with FreeSurfer’s own parcellation is partly built into the reference, which is why we report the label-free DareaD_{\mathrm{area}} beside them.

Area distortion. The SS regions partitioning M\mathcal{M} are geodesic Voronoi cells based on farthest-point samples on the input meshes (unrelated to the candidate patches of § 4.2). We partition both surfaces by the lumped vertex mass MvvM_{vv} (§ 3.1), so no area is lost at region boundaries, and we average the metric over all non-empty regions on both surfaces. Each region area is divided by its native surface’s total area before taking the log ratio.

Additional Empirical Results

Cost of Linearized Couplings

Linear attention replaces the softmax kernel with an approximate computation. Unlike the exact kernels of Table 1, it therefore changes the correspondence computations themselves, and affects the resulting training dynamics. We report the performance drop across standard benchmarks in Table S3.

ELU is similar to the dense coupling on FAUST but significantly worse on four of the six benchmarks. Performer is notably worse on five. Both comparisons are inconclusive on SHREC’19, where seed variance is large. The largest gaps are on SMAL and DT4D-inter, the most significantly non-isometric datasets. This is consistent with the difficulty of representing a sharply peaked softmax with the low-rank feature maps of § 4, which we further examine in § 8.3.

Rank of the converged coupling. In § 4, we state that the soft assignment is typically near-full rank. This is an empirical observation, which we observe in the following settings. On one converged FlashAttention checkpoint per benchmark and 20–40 test pairs, we replace the exact product ΠΦ\mathbf{\Pi}\mathbf{\Phi} by each approximation and report the relative Frobenius error of the induced 200×200200 \times200 functional map (Table S4). Rank is near-full everywhere: even the optimal rank-mm truncation of Π\mathbf{\Pi} by SVD errs by 0.36–0.59 on every benchmark at m=200m=200, the spectral dimension, and reaching ∼10−2\sim10^{-2} requires m=1024m=1024.

BenchmarksupportSVD m=200m=200SVD m=1024m=1024Nyström m=1024m=1024top-kk k=128k=128spherical p=32p=32
FAUST24.10.4490.02090.1490.00270.028
SCAPE24.00.4590.01330.1600.00620.038
DT4D36.00.5870.02330.1260.01130.041
SMAL54.40.3580.00580.1570.01340.064

Table S4. Approximating a converged coupling. Each method approximates the converged point-to-point coupling Π\Pi. We assess optimal rank-mm truncation by SVD, Nyström with mm landmarks, top-kk row truncation, or the spherical kernel (p=32p=32). Entries report the relative Frobenius error of the functional map induced by the approximated coupling, for one converged checkpoint per benchmark. Support is the effective number of vertices per softmax row. Benchmarks are ordered by support; best per column in bold.

With increasing deviation from isometry, the effective row support grows from 24 vertices on FAUST to 54 on SMAL. Over the same range, top-kk truncation error increases 5×5\times and spherical-kernel error 2.3×2.3\times, whereas optimal truncation and Nyström show no corresponding degradation. We study the associated sharpness in more detail in § 8.3, and Table S3 shows the effect on training dynamics in terms of the final geodesic error.

Empirical Scaling with Mesh Resolution

Setup. To assess the scaling complexity of Geo-FlashAttention compared to other methods, we decimate the released TOPKIDS-HD scans to six uniform resolutions from 5k to 45k vertices, rescaled to unit area. Together with the native scans (58k vertices on average, quoted as 60k in the main text), this yields seven resolutions. At each resolution, we time the coupling and the full training step on one H200 NVL, and fit the exponent aa in y=cNay = cN^a by least squares on log⁡y\log y against log⁡N\log N over the four upper resolutions (20k, 30k, 45k and native), properly accounting for startup overheads. We report scaling coefficients from empirical fits over this decimation range.

Results. At 5k the methods differ by only 1.3×1.3\times per training step, because the feature extractor dominates the computation cost. At 60k, we see the coupling dominating. The fitted runtime exponents of the isolated coupling are a=1.97a=1.97 for dense attention, 1.83 for FlashAttention, 0.81 for linear attention and 0.81 for Geo-FlashAttention. The full-step exponents are 1.67, 1.13, 0.73 and 0.74, as feature extraction and spectral operations add fixed costs. Peak training memory scales with a=1.94a=1.94 for dense attention and a=0.98a=0.98 for every non-dense method, which stay within 0.01 GiB of one another at 60k. Candidate construction makes Geo-FlashAttention slower at small resolutions, but it crosses

Qualitative comparison of spatial–spectral couplings for SMAL, DT4D-inter, and FAUST across Dense, FlashAtt., Geo-FlashAtt., Linear (ELU), and Performer

Figure S3. Qualitative comparison of spatial–spectral couplings. Texture is transferred through maps estimated from the same shape pair and seed. The exact couplings preserve the same regions. On SMAL and DT4D-inter, Performer fragments the transferred grid, whereas ELU mainly shifts region boundaries, consistent with Table S3. All couplings appear similar on FAUST.

Learned cortical descriptors for a Mindboggle pair, with source and target cortical regions and their joint t-SNE embedding

Figure S4. Learned cortical descriptors. One Mindboggle pair, colored by DKT regions, with the joint t-SNE embedding of its descriptors.

FlashAttention near 20k vertices. At 60k, its coupling is 3.0×, and its training step is 1.5× faster, at the same peak memory. Figure S2 shows the full curves.

Figure S2. Training time and peak memory across seven TOPKIDS resolutions, and accuracy relative to the dense coupling on the standard benchmarks. In (c), markers are means over five seeds, error bars their standard deviation, and the grey band the spread of the dense reference; the rows repeat the ULRSSM block of Table 1 and the ELU column of Table S3 under the same seeds and exclusions (§ 7.1). Non-dense methods share a single memory curve. One representative per class of coupling is shown; Performer, KeOps and fp32 SDPA are omitted.

Coupling Sharpness and Non-Isometry

The temperature τ=0.07\tau=0.07 of the soft correspondence (§ 4) is inherited from prior work [12] and held fixed in every experiment. Here, we ask whether that constant is optimal, whether its optimum is constant, and how this sharpness affects linear couplings.

To vary sharpness continuously around a specific temperature, we replace the exponential kernel on the normalized descriptors with the bandwidth-matched spherical kernel ((1+qiTkj)/21 + q_i^{\mathsf T} k_j)/2)p^p, which approximates exp⁡(qiTkj/τ)\exp(q_i^{\mathsf T} k_j/\tau) on the unit sphere and matches τ\tau at p=2/τ≈29p = 2/\tau\approx29. A larger pp is sharper. We assess the product using a single converged run per benchmark and a fixed subset of test pairs, measuring the alignment loss of the induced functional map relative to the exact softmax.

Results. We observe that the optimal sharpness depends on the benchmark and even changes sign with non-isometry. On FAUST the objective falls to 0.67 of the softmax value at p≈96p \approx96; SCAPE, DT4D and TOPKIDS-HD show optima near p≈48p \approx48 (0.95–0.96). On the strongly non-isometric SMAL, sharpening beyond the matched point only hurts (1.06 at p=32p=32, 1.39 at p=128p=128). These results suggest that near-isometric matching prefers an almost unimodal coupling, while non-isometric matching relies on the blur of the softer softmax.

We also learn pp jointly with the descriptors, selecting checkpoints with the sharpness-independent hard assignment. On SMAL, all five seeds converge to p≈63p \approx63 (within ±1) and reduce validation error relative to the fixed-τ\tau softmax in every seed, by 9% on average. On FAUST, pp continues to increase under the shorter schedule but gives slightly worse validation error than the fixed-τ\tau softmax. Thus the preferred sharpness is benchmark-dependent and changes as the descriptors co-adapt. These diagnostic results are not directly comparable to Tab. 1, where we keep τ\tau fixed in the reported comparisons because optimizing sharpness modulates the coupling rather than its implementation.

Qualitative Results

Cortical surfaces. Figure S5 and Figure S6 provide complementary views of a held-out Mindboggle-101 pair: the smooth field reveals local distortion, while the DKT31 labels show region-level alignment. ULRSSM with FlashAttention produces coherent fields and region boundaries comparable to the specialized baselines, consistent with the quantitative results in § 5.3.

Smooth-field transfer on Mindboggle-101: (a) Source, (b) FBM, (c) FreeSurfer, (d) V2C-Flow, (e) ULRSSM + FlashAtt. (ours)

Figure S5. Smooth-field transfer on Mindboggle-101. A source field is transferred to a held-out target using each correspondence method.

Cortical parcellation transfer on Mindboggle-101: (a) Source, (b) FBM, (c) FreeSurfer, (d) V2C-Flow, (e) ULRSSM + FlashAtt. (ours), (f) Ground truth

Figure S6. Cortical parcellation transfer on Mindboggle-101. DKT31 source labels are transferred to the same target; the final panel shows its ground-truth atlas.

Patch Construction: Euclidean and Geodesic Voronoi Cells

We compare Euclidean patches built from vertex positions with the intrinsic geodesic Voronoi partition used in § 4.2, in which every vertex belongs to the center nearest along the surface (P1) and every cell is a connected region (P2). Table S5 measures how often Euclidean patches violate these two properties, and Table S6 what this costs the coupling. Our released implementation builds geodesic patches by default and retains the Euclidean ones for completeness.

Benchmark∣V∣|V|P1 viol. (%)P2 viol. patchesP2 viol. vertices
FAUST5.0 k10.69.24.4
SCAPE5.0 k6.12.20.6
SHREC’195.2 k10.18.34.0
SMAL5.2 k13.013.35.8
TOPKIDS10.4 k12.311.22.6
TOPKIDS-HD60 k11.36.21.6
Cortex146 k8.014.82.9

Table S5. Table S5. Euclidean vs. geodesic patches. P1: vertices whose assigned patch is not their geodesically nearest. P2: patches that are not connected regions, and vertices outside the largest piece of their patch. Averages over all meshes of each benchmark; the geodesic partition has none by construction. Violations are common and do not grow with resolution.

RR∣Sa,R∣|S_{a,R}|Recall Euc.Recall Geo.Mass Euc.Mass Geo.
41320.6850.6980.7160.735
82600.8290.8410.8600.879
123790.8820.8880.9070.921
164870.9090.9130.9310.941
246920.9390.9400.9540.961
4010780.9640.9650.9730.977
6416320.9790.9800.9840.987

Table S6. Table S6. Support quality under either partition on SMAL (400 test pairs), by candidate budget RR. Recall: ground-truth correspondent inside the support. Mass: dense softmax mass the support retains. The two partitions differ marginally.

TOPKIDS self-contact. By grouping spatially adjacent surface parts across extrinsic self-contact, Euclidean patch embeddings may regularize the coupling on TOPKIDS (Figure S7).

Euclidean patches on self-contact regions in TOPKIDS

Figure S7. Euclidean patches on self-contact regions in TOPKIDS. Euclidean patch partition of a TOPKIDS shape (kid06, 353 patches). (a, c) One patch highlighted in each; (b, d) close-ups of the boxed regions. Neither patch is a connected region: each covers two surface pieces that touch in R3\mathbb{R}^{3} but are separated along the surface, the underside of the upper arm and the shoulder (b), and the two sides of an abdominal skin fold (d).

Candidate Budget RR

The budget RR of Geo-FlashAttention fixes only the support of the sparse attention. Sweeping it traces how closely the restricted coupling approximates the dense one. Table S7 reports, per benchmark, the relative error of the functional map computed through the restricted coupling against the dense one, the fraction of query rows whose dense argmax remains inside the support, and the agreement of the recovered point maps. R∗R^{*} summarizes each sweep as the smallest budget that retains the dense argmax for 99% of rows.

RRFAUSTSCAPESHREC’19SMALDT4D
45.4e-24.9e-22.1e-11.3e-14.8e-2
81.4e-21.7e-21.2e-15.7e-21.2e-2
166.8e-31.1e-27.0e-22.9e-25.5e-3
324.0e-36.6e-33.9e-21.8e-23.4e-3
403.3e-35.6e-33.2e-21.4e-23.0e-3
641.9e-33.6e-31.8e-26.5e-32.0e-3
1285.6e-41.4e-35.2e-31.5e-39.3e-4
dense argmax retained at R=40R = 401.0001.0000.9970.9871.000
R∗R^*, smallest budget retaining 99%8824568
map agreement with dense at R=40R = 400.9920.9950.9490.9600.994

Table S7. Table S7. Restricted vs. dense coupling. Top: ∥C^−C∥F/∥C∥F\lVert\hat{C}-C\rVert_F/\lVert C\rVert_F between the functional maps computed through the restricted and the dense coupling. Bottom: dense argmax retained at R=40R = 40, the criterion budget R∗R^*, and point-map agreement with dense at R=40R = 40. The error decreases smoothly with RR and is largest on the non-isometric benchmarks.

Geodesic Error Distributions

Figure S8 shows that, across benchmarks, the maximum separation among exact couplings is 0.06–2.46 percentage points over the full error distribution. The linearized variants lag on SMAL and DT4D-inter but track the exact couplings on FAUST, SCAPE and DT4D-intra, consistent with Table S3.

Figure S8. Geodesic error distributions. Cumulative fraction of correspondences below each error threshold, using the same runs and exclusions as Table 1 and Table S3. Near-isometric panels span 0–10 and the others 0–20; pair counts and exclusions are shown in each panel.

References

  1. [1]Dragomir Angelov, Praveen Srinivasan, Daphne Koller, Sebastian Thrun, Jim Rodgers, and James Davis. SCAPE: Shape completion and animation of people. ACM TOG (SIGGRAPH), 24(3):408–416, 2005. 6
  2. [2]Souhaib Attaiki and Maks Ovsjanikov. Understanding and improving features learned in deep functional maps. In CVPR, pages 1316–1326, 2023. 4arxiv.org/abs/2303.16527
  3. [3]Souhaib Attaiki, Gautam Pai, and Maks Ovsjanikov. DPFM: Deep partial functional maps. In 3DV, pages 175–185, 2021. 3DOI
  4. [4]Mathieu Aubry, Ulrich Schlickewei, and Daniel Cremers. The wave kernel signature: A quantum mechanical approach to shape analysis. In ICCV, pages 1626–1633, 2011. 2, 8DOI
  5. [5]Lennart Bastian, Alexander Baumann, Emily Hoppe, Vincent Bürgin, Ha Young Kim, Mahdi Saleh, Benjamin Busam, and Nassir Navab. S3M: Scalable statistical shape modeling through unsupervised correspondences. In MICCAI, pages 459–469, 2023. 1, 2arxiv.org/abs/2304.07515
  6. [6]Lennart Bastian, Yizh eng Xie, Nassir Navab, and Zorah L ähner. Hybrid functional maps for crease-aware non-isometric shape matching. In CVPR, pages 3313–3323, 2024. 2, 4, 6, 7arxiv.org/abs/2312.03678
  7. [7]Iz Beltagy, Matthew E. Peters, and Arman Cohan. Long-former: The long-document transformer. arXiv preprint arXiv:2004.05150, 2020. 3arxiv.org/abs/2004.05150
  8. [8]Federica Bogo, Javier Romero, Matthew Loper, and Michael J. Black. FAUST: Dataset and evaluation for 3D mesh registration. In CVPR, pages 3794–3801, 2014. 6DOI
  9. [9]Fabian Bongratz, Anne-Marie Rickmann, and Christian Wachinger. Neural deformation fields for template-based reconstruction of cortical surfaces from MRI. Medical Image Analysis, 93:103093, 2024. 3, 8, 2arxiv.org/abs/2401.12938
  10. [10]Fabian Bongratz, Jan Fecht, Anne-Marie Rickmann, and Christian Wachinger. V2C-Long: Longitudinal cortex reconstruction with spatiotemporal correspondence. Imaging Neuroscience, 3:imag_a_00500, 2025. 1, 2DOI
  11. [11]Alexander M. Bronstein, Michael M. Bronstein, and Ron Kimmel. Numerical Geometry of Non-Rigid Shapes. Springer, 2008. 2DOI
  12. [12]Dongliang Cao, Paul Roetzer, and Florian Bernard. Unsupervised learning of robust spectral shape matching. ACM TOG (SIGGRAPH), 42(4):1–15, 2023. 2, 3, 4, 6, 7, 8DOI
  13. [13]Dongliang Cao, Zorah L ähner, and Florian Bernard. Synchronous diffusion for unsupervised smooth non-rigid 3D shape matching. In ECCV, pages 262–281, 2024. 7arxiv.org/abs/2407.08244
  14. [14]Benjamin Charlier, Jean F eydy, Joan Alexis Glaunès, François-David Collin, and Ghislain Durif. Kernel operations on the GPU, with autodiff, without memory overflows. Journal of Machine Learning Research, 22(74):1–6, 2021. 3, 6
  15. [15]Krzysztof Choromanski, Valerii Likhosherstov, David Dohan, Xingyou Song, Andreea Gane, Tamás Sarlós, Peter Hawkins, Jared Davis, Afroz Mohiuddin, Lukasz Kaiser, David Belanger, Lucy Colwell, and Adrian Weller. Rethinking attention with Performers. In ICLR, 2021. 2, 3, 5arxiv.org/abs/2009.14794
  16. [16]Anders M. Dale, Bruce Fischl, and Martin I. Sereno. Cortical surface-based analysis. I. Segmentation and surface reconstruction. NeuroImage, 9(2):179–194, 1999. 2, 8
  17. [17]Tri Dao. FlashAttention-2: Faster attention with better parallelism and work partitioning. In ICLR, 2024. 2, 3, 5arxiv.org/abs/2307.08691
  18. [18]Tri Dao, Daniel Y. Fu, Stefano Ermon, Atli Rudra, and Christopher Ré. FlashAttention: Fast and memory-efficient exact attention with IO-awareness. In NeurIPS, pages 16344–16359, 2022. 2, 3, 5arxiv.org/abs/2205.14135
  19. [19]Bradford C. Dickerson, Akram Bakkour, David H. Salat, Eric Feczko, Jenni Pacheco, Douglas N. Greve, Fran Grodstein, Christopher I. Wright, Deborah Blacker, H. Diana Rosas, Reisa A. Sperling, Alireza Atri, John H. Growdon, Bradley T. Hyman, John C. Morris, Bruce Fischl, and Randy L. Buckner. The cortical signature of Alzheimer’s disease: Regionally specific cortical thinning relates to symptom severity in very mild to mild AD dementia and is detectable in asymptomatic amyloid-positive individuals. Cerebral Cortex, 19(3):497–510, 2009. 3
  20. [20]Nicolas Donati, Abhishek Sharma, and Maks Ovsjanikov. Deep geometric functional maps: Robust feature learning for shape correspondence. In CVPR, pages 8592–8601, 2020. 2, 6, 7arxiv.org/abs/2003.14286
  21. [21]Nicolas Donati, Etienne Corman, Simone Melzi, and Maks Ovsjanikov. Complex Functional Maps: A Conformal Link Between Tangent Bundles. Computer Graphics Forum, 41(1):317–334, 2022. 1arxiv.org/abs/2112.09546
  22. [22]Nicolas Donati, Etienne Corman, and Maks Ovsjanikov. Deep orientation-aware functional maps: Tackling symmetry issues in shape matching. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 742–751, 2022. 1arxiv.org/abs/2204.13453
  23. [23]Viktoria Ehm, Nafie El Amrani, Yizheng Xie, Lennart Bastian, Maolin Gao, Weikang Wang, Lu Sang, Dongliang Cao, Tobias Weißberg, Zorah Lähner, Daniel Cremers, and Florian Bernard. Beyond complete shapes: A benchmark for quantitative evaluation of 3D shape surface matching algorithms. Computer Graphics Forum, 44(5):e70186, 2025. 1arxiv.org/abs/2411.03511
  24. [24]Marvin Eisenberger, Zorah Lähner, and Daniel Cremers. Smooth shells: Multi-scale shape registration with functional maps. In CVPR, pages 12265–12274, 2020. 7arxiv.org/abs/1905.12512
  25. [25]Marvin Eisenberger, Aysim Toker, Laura Leal-Taixé, and Daniel Cremers. Deep shells: Unsupervised shape correspondence with optimal transport. In NeurIPS, pages 10491–10502, 2020. 7arxiv.org/abs/2010.15261
  26. [26]Nafie El Amrani, Dongliang Cao, and Florian Bernard. A universal and flexible framework for unsupervised statistical shape model learning. In MICCAI, pages 26–36, 2024. 1, 2DOI
  27. [27]N. El Amrani, P. Roetzer, and F. Bernard. High-resolution 3d shape matching with global optimality and geometric consistency. Computer Graphics Forum, 44(5):e70208, 2025. 2DOI
  28. [28]Bruce Fischl. FreeSurfer. NeuroImage, 62(2):774–781, 2012. 2, 3, 8DOI
  29. [29]Bruce Fischl, Martin I. Sereno, Roger B. H. Toetell, and Anders M. Dale. High-resolution intersubject averaging and a coordinate system for the cortical surface. Human Brain Mapping, 8(4):272–284, 1999. 1pubmed.ncbi.nlm.nih.gov/10619420
  30. [30]Oshri Halimi, Or Litany, Emanuele Rodolà, Alex M. Bronstein, and Ron Kimmel. Unsupervised learning of dense shape correspondence. In CVPR, pages 4370–4379, 2019. 2DOI
  31. [31]Alexandra Heuschling, Hannah Meinhold, and Leif Kobbelt. Establishing shape correspondences: A survey. Computer Graphics Forum, page e70406, 2026. Eurographics State-of-the-Art Report. 2
  32. [32]Angelоs Katharopoulos, Apoorv Vyas, Nikolaos Pappas, and François Fleuret. Transformers are RNNs: Fast autoregressive transformers with linear attention. In ICML, pages 5156–5165, 2020. 2, 3, 5
  33. [33]Vladimir G. Kim, Yaron Lipman, and Thomas Funkhouser. Blended intrinsic maps. ACM TOG (SIGGRAPH), 30(4):1–12, 2011. 2
  34. [34]Arno Klein and Jason Tourville. 101 labeled brain images and a consistent human cortical labeling protocol. Frontiers in Neuroscience, 6:171, 2012. 8, 2DOI
  35. [35]Zorah Lähner, Emanuele Rodolà, Michael M. Bronstein, Daniel Cremers, Oliver Burghard, Luca Cosmo, Alexander Dieckmann, Reinhard Klein, and Yusuf Sahilli̇oğlu. SHREC’16: Matching of deformable shapes with topological noise. In Eurographics Workshop on 3D Object Retrieval (3DOR), pages 55–60, 2016. 6, 7
  36. [36]Lei Li, Nicolas Donati, and Maks Ovsjanikov. Learning multi-resolution functional maps with spectral attention for robust shape matching. In NeurIPS, pages 29336–29349, 2022. 3, 7arxiv.org/abs/2210.06373
  37. [37]Yang Li, Hikari Takehara, Takafumi Taketomi, Bo Zheng, and Matthias Nießner. 4DComplete: Non-rigid motion estimation beyond the observable surface. In ICCV, pages 12706–12716, 2021. 6arxiv.org/abs/2105.01905
  38. [38]Yaron Lipman and Thomas Funkhouser. Möbius voting for surface correspondence. ACM TOG (SIGGRAPH), 28(3):1–12, 2009. 2
  39. [39]Or Litany, Tal Remez, Emanuele Rodola, Alex Bronstein, and Michael Bronstein. Deep functional maps: Structured prediction for dense shape correspondence. In ICCV, pages 5659–5667, 2017. 2arxiv.org/abs/1704.08686
  40. [40]Hervé Lombaert, Leo Grady, Jonathan R. Polimeni, and Farida Cheriet. Fast brain matching with spectral correspondence. In Information Processing in Medical Imaging (IPMI), pages 660–673, 2011. 3, 8, 2pubmed.ncbi.nlm.nih.gov/21761694
  41. [41]Matthew Loper, Naureen Mahmood, Javier Romero, Gerard Pons-Moll, and Michael J. Black. SMPL: A skinned multi-person linear model. ACM TOG (SIGGRAPH Asia), 34(6):1–16, 2015. 1
  42. [42]Filippo Maggioli, Daniele Baieri, Emanuele Rodolà, and Simone Melzi. ReMatching: Low-resolution representations for scalable shape correspondence. In ECCV, pages 183–200, 2024. 2DOI
  43. [43]Robin Magnet and Maks Ovsjanikov. Scalable and efficient functional map computations on dense meshes. Computer Graphics Forum, 42(2):89–101, 2023. 3arxiv.org/abs/2303.05965
  44. [44]Robin Magnet and Maks Ovsjanikov. Memory-scalable and simplified functional map learning. In CVPR, pages 4041–4050, 2024. 3, 4, 6, 7DOI
  45. [45]Simone Melzi, Riccardo Marin, Emanuele Rodolà, Umberto Castellani, Jing Ren, Adrien Poulenard, Peter Wonka, and Maks Ovsjanikov. SHREC’19: Matching humans with different connectivity. In Eurographics Workshop on 3D Object Retrieval (3DOR), pages 121–128, 2019. 6
  46. [46]Simone Melzi, Jing Ren, Emanuele Rodolà, Abhishek Sharma, Peter Wonka, and Maks Ovsjanikov. ZoomOut: Spectral upsampling for efficient shape correspondence. ACM TOG (SIGGRAPH Asia), 38(6):1–14, 2019. 2, 3, 4, 6, 7arxiv.org/abs/1904.07865
  47. [47]Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, Adrian Butscher, and Leonidas Guibas. Functional maps: A flexible representation of maps between shapes. ACM TOG (SIGGRAPH), 31(4):1–11, 2012. 2
  48. [48]Markus N. Rabe and Charles Staats. Self-attention does not need O(n²) memory. arXiv preprint arXiv:2112.05682, 2021. 7arxiv.org/abs/2112.05682
  49. [49]Alessandro Raganato, Gabriella Pasi, and Simone Melzi. Attention and positional encoding are (almost) all you need for shape matching. Computer Graphics Forum, 42(5):e14912, 2023. 3DOI
  50. [50]Jing Ren, Adrien Poulenard, Peter Wonka, and Maks Ovsjanikov. Continuous and orientation-preserving correspondences via functional maps. ACM TOG (SIGGRAPH Asia), 37(6):1–16, 2018. 2arxiv.org/abs/1806.04455
  51. [51]Jing Ren, Simone Melzi, Peter Wonka, and Maks Ovsjanikov. Discrete optimization for shape matching. Computer Graphics Forum, 40(5):81–96, 2021. 4DOI
  52. [52]Martin Reuter, Franz-Erich Wolter, and Niklas Peinecke. Laplace–Beltrami spectra as “Shape-DNA” of surfaces and solids. Computer-Aided Design, 38(4):342–366, 2006. 2
  53. [53]Alessandro Riva, Alessandro Raganato, and Simone Melzi. Localized gaussians as self-attention weights for point clouds correspondence. In Smart Tools and Applications in Graphics – Eurographics Italian Chapter Conference. The Eurographics Association, 2024. 3DOI
  54. [54]Emma C. Robinson, Saad Jbabdi, Matthew F. Glasser, Jesper Andersson, Gregory C. Burgess, Michael P. Harms, Stephen M. Smith, David C. Van Essen, and Mark Jenkinson. MSM: A new flexible framework for Multimodal Surface Matching. NeuroImage, 100:414–426, 2014. 3DOI
  55. [55]Emanuele Rodolà, Michael Möller, and Daniel Cremers. Point-wise map recovery and refinement from functional correspondence. In Vision, Modeling, and Visualization (VMV), pages 25–32, 2015. 2arxiv.org/abs/1506.05603
  56. [56]Paul Roetzer and Florian Bernard. SpiderMatch: 3D shape matching with global optimality and geometric consistency. In CVPR, pages 14543–14553, 2024. 2DOI
  57. [57]Jean-Michel Roufosse, Abhishek Sharma, and Maks Ovsjanikov. Unsupervised deep learning for structured shape matching. In ICCV, pages 1617–1627, 2019. 2arxiv.org/abs/1812.03794
  58. [58]Nicholas Sharp, Souhaib Attaiki, Keenan Crane, and Maks Ovsjanikov. DiffusionNet: Discretization agnostic learning on surfaces. ACM TOG, 41(3):1–16, 2022. 2arxiv.org/abs/2012.00888
  59. [59]Olga Sorkine and Marc Alexa. As-rigid-as-possible surface modeling. In Eurographics Symposium on Geometry Processing (SGP), pages 109–116, 2007. 1DOI
  60. [60]Robert W. Sumner and Jovan Popović. Deformation transfer for triangle meshes. ACM TOG (SIGGRAPH), 23(3):399–405, 2004. 1
  61. [61]Jian Sun, Maks Ovsjanikov, and Leonidas Guibas. A concise and provably informative multi-scale signature based on heat diffusion. Computer Graphics Forum, 28(5):1383–1392, 2009. 2DOI
  62. [62]Mingze Sun, Shiwei Mao, Puhua Jiang, Maks Ovsjanikov, and Ruqi Huang. Spatially and spectrally consistent deep functional maps. In ICCV, pages 14497–14507, 2023. 2, 4arxiv.org/abs/2308.08871
  63. [63]Philippe Tillet, H. T. Kung, and David Cox. Triton: An intermediate language and compiler for tiled neural network computations. In ACM SIGPLAN Int. Workshop on Machine Learning and Programming Languages (MAPL), pages 10–19, 2019. 6DOI
  64. [64]Giovanni Trappolini, Luca Cosmo, Luca Moschella, Riccardo Marin, Simone Melzi, and Emanuele Rodolà. Shape Registration in the Time of Transformers. In Advances in Neural Information Processing Systems, pages 5731–5744. Curran Associates, Inc., 2021. 3arxiv.org/abs/2106.13679
  65. [65]Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NeurIPS, pages 5998–6008, 2017. 2, 3arxiv.org/abs/1706.03762
  66. [66]Matthias Vestner, Zorah Lähner, Amit Boyarski, Or Litany, Ron Slossberg, Tal Remez, Emanuele Rodolà, Alex Bronstein, Michael Bronstein, Ron Kimmel, and Daniel Cremers. Efficient Deformable Shape Correspondence via Kernel Matching. In 3DV, pages 517–526, 2017. 2arxiv.org/abs/1707.08991
  67. [67]Matthias Vestner, Roee Litman, Emanuele Rodolà, Alex Bronstein, and Daniel Cremers. Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space. In CVPR, pages 3327–3336, 2017. 2arxiv.org/abs/1701.00669
  68. [68]Tony Danjun Wang, Lennart Bastian, Tobias Czempiel, Christian Heiliger, and Nassir Navab. Beyond role-based surgical domain modeling: Generalizable re-identification in the operating room. Medical Image Analysis, 105:103687, 2025. 1DOI
  69. [69]Thomas Windheuser, Ulrich Schlickewei, Frank R. Schmidt, and Daniel Cremers. Geometrically consistent elastic matching of 3D shapes: A linear programming solution. In ICCV, pages 2134–2141, 2011. 2
  70. [70]Yizheng Xie, Lennart Bastian, Congyue Deng, Thomas W. Mitchel, Maolin Gao, and Daniel Cremers. DeepShape-MatchingKit: Accelerated functional map solver and shape matching pipelines revisited. In CVPRW, pages 159–168, 2026. 6, 7, 2DOI
  71. [71]B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauteren, Nicholas A. Chao, Bruce Fischl, and Polina Golland. Spherical Demons: Fast diffeomorphic landmark-free surface registration. IEEE Transactions on Medical Imaging, 29(3):650–668, 2010. 3DOI
  72. [72]Manzil Zaheer, Guru Guruganes h, Kumar Avinava Dubey, Joshua Ainslie, Chris Alberti, Santiago Ontañón, Philip Pham, Anirudh Ravula, Qifan Wang, Li Yang, and Amr Ahmed. Big Bird: Transformers for longer sequences. In NeurIPS, pages 17283–17297, 2020. 3arxiv.org/abs/2007.14062
  73. [73]Aleksei Zhuravlev, Lennart Bastian, Dongliang Cao, Nafie El Amrani, Paul Roetzer, Viktoria Ehm, Riccardo Marin, Hiroki Nishizawa, Shigeo Morishima, Christian Theobalt, Nassir Navab, Daniel Cremers, Florian Bernard, Zorah Lähner, and Vladislav Golyanik. Non-rigid 3D shape correspondences: From foundations to open challenges and opportunities. Computer Graphics Forum, 45(2):e70397, 2026. Eurographics State-of-the-Art Report. 2
  74. [74]Silvia Zuffi, Angjoo Kanazawa, David Jacobs, and Michael J. Black. 3D menagerie: Modeling the 3D shape and pose of animals. In CVPR, pages 6365–6373, 2017. 6arxiv.org/abs/1611.07700

Paper details

vlnc:W_293jbt22
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents