Raganato, AlessandroPasi, GabriellaMelzi, SimoneMemari, PooranSolomon, Justin2023-06-302023-06-3020231467-8659https://doi.org/10.1111/cgf.14912https://diglib.eg.org:443/handle/10.1111/cgf14912The fast development of novel approaches derived from the Transformers architecture has led to outstanding performance in different scenarios, from Natural Language Processing to Computer Vision. Recently, they achieved impressive results even in the challenging task of non-rigid shape matching. However, little is known about the capability of the Transformer-encoder architecture for the shape matching task, and its performances still remained largely unexplored. In this paper, we step back and investigate the contribution made by the Transformer-encoder architecture compared to its more recent alternatives, focusing on why and how it works on this specific task. Thanks to the versatility of our implementation, we can harness the bi-directional structure of the correspondence problem, making it more interpretable. Furthermore, we prove that positional encodings are essential for processing unordered point clouds. Through a comprehensive set of experiments, we find that attention and positional encoding are (almost) all you need for shape matching. The simple Transformer-encoder architecture, coupled with relative position encoding in the attention mechanism, is able to obtain strong improvements, reaching the current state-of-the-art.CCS Concepts: Computing methodologies -> Shape analysis; Theory of computation -> Computational geometryComputing methodologiesShape analysisTheory of computationComputational geometry10.1111/cgf.1491212 pages