An efficient algorithm reconstructs manifold geometry from random geometric graphs under the manifold assumption with distance-dependent connection probabilities.
Reconstruction and interpolation of manifolds II : I nverse problems for R iemannian manifolds with partial distance data
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Reconstructing the Geometry of Random Geometric Graphs
An efficient algorithm reconstructs manifold geometry from random geometric graphs under the manifold assumption with distance-dependent connection probabilities.