Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation

  title={Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation},
  author={Ery Arias-Castro and Thibaut Le Gouic},
  journal={Discrete & Computational Geometry},
  • Ery Arias-Castro, Thibaut Le Gouic
  • Published 2019
  • Mathematics, Computer Science
  • Discrete & Computational Geometry
  • We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of Bernstein et al. (Graph approximations to geodesics on embedded manifolds, Tech. Rep., Department of Psychology, Stanford University, 2000). We do the same with curvature-constrained shortest paths and their distances, establishing what we believe are the first… CONTINUE READING
    6 Citations

    Figures and Topics from this paper

    Minimax Estimation of Distances on a Surface and Minimax Manifold Learning in the Isometric-to-Convex Setting
    • PDF
    Manifold learning with arbitrary norms
    • PDF
    Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning
    • 5
    • PDF
    Efficient Solvers for Sparse Subspace Clustering
    • 12
    • PDF


    Shortest paths of bounded curvature in the plane
    • 244
    • PDF
    Graph approximations to geodesics on embedded manifolds
    • 255
    • Highly Influential
    Multiple Manifold Clustering Using Curvature Constrained Path
    • 7
    • PDF
    Nonlinear subspace clustering using curvature constrained distances
    • 13
    • PDF
    Geodesics in Euclidean space with analytic obstacle
    • 9
    • PDF
    Finding the Homology of Submanifolds with High Confidence from Random Samples
    • 518
    • PDF
    Uniform Convergence of Discrete Curvatures from Nets of Curvature Lines
    • 9
    • PDF
    Riemannian Manifolds: An Introduction to Curvature
    • 827
    Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters
    • 99
    • PDF
    Geodesics in Riemannian Manifolds with Boundary Jianghai Hu
    • 22
    • PDF