TL;DR
GeGnn is a graph neural network-based method that efficiently computes approximate geodesic distances on mesh surfaces with high speed and accuracy, even on noisy or incomplete data.
Contribution
The paper introduces a novel GNN architecture with specialized modules for embedding meshes, enabling fast, accurate geodesic distance computation after minimal precomputation.
Findings
Achieves orders-of-magnitude faster computation than existing methods.
Maintains high accuracy comparable to traditional algorithms.
Demonstrates robustness on noisy and incomplete meshes.
Abstract
We present GeGnn, a learning-based method for computing the approximate geodesic distance between two arbitrary points on discrete polyhedra surfaces with constant time complexity after fast precomputation. Previous relevant methods either focus on computing the geodesic distance between a single source and all destinations, which has linear complexity at least or require a long precomputation time. Our key idea is to train a graph neural network to embed an input mesh into a high-dimensional embedding space and compute the geodesic distance between a pair of points using the corresponding embedding vectors and a lightweight decoding function. To facilitate the learning of the embedding, we propose novel graph convolution and graph pooling modules that incorporate local geodesic information and are verified to be much more effective than previous designs. After training, our method…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network · Focus · Convolution
