LiteGE: Lightweight Geodesic Embedding for Efficient Geodesics Computation and Non-Isometric Shape Correspondence
Not on the map. Why?
Abstract (arXiv)
Computing geodesic distances on 3D surfaces is fundamental to many tasks in 3D vision and geometry processing, with deep connections to tasks such as shape correspondence. Recent learning-based methods achieve strong performance but rely on large 3D backbones, leading to high memory usage and latency, which limit their use in interactive or resource-constrained settings. We introduce LiteGE, a lightweight approach that constructs compact, category-aware shape descriptors by applying Principal Component Analysis (PCA) to unsigned distance field (UDFs) samples at informative voxels. This descriptor is efficient to compute and removes the need for high-capacity networks. LiteGE remains robust on sparse point clouds, supporting inputs with as few as 300 points, where prior methods fail. Extensive experiments show that LiteGE reduces memory usage and inference time by up to 300× compared to existing neural approaches. In addition, by exploiting the intrinsic relationship between geodesic distance and shape correspondence, LiteGE enables fast and accurate shape matching. Our method achieves up to 1000× speedup over state-of-the-art mesh-based approaches while maintaining comparable accuracy on non-isometric shape pairs, including evaluations on point-cloud inputs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 14 of its 44 references that are in the map. First posted on arXiv 19 Dec 2025.
Builds on
14 of 44 references.
References · 14
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
- 2020Point Transformercited by 1,470
- 2018On the Continuity of Rotation Representations in Neural Networkscited by 1,214
- 2023Objaverse-XL: A Universe of 10M+ 3D Objectscited by 774
- 20163D Menagerie: Modeling the 3D shape and pose of animalscited by 312
- 2020Neural Unsigned Distance Fields for Implicit Function Learningcited by 265
- 20183D-CODED : 3D Correspondences by Deep Deformationcited by 160
- 2017Deep Functional Maps: Structured Prediction for Dense Shape Correspondencecited by 134
- 2023Unsupervised Learning of Robust Spectral Shape Matchingcited by 57
- 2024Spectral Meets Spatial: Harmonising 3D Shape Matching and Interpolationcited by 26
- 2023NeuroGF: A Neural Representation for Fast Geodesic Distance and Path Queriescited by 7
Built on by
Citing papers per year: 2026: 2.
2 papers.