• DOI:10.1007/s00454-019-00060-7
Corpus ID: 30058008

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

@article{AriasCastro2019UnconstrainedAC,
  title={Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation},
  author={Ery Arias-Castro and Thibaut Le Gouic},
  journal={Discrete & Computational Geometry},
  year={2019},
  volume={62},
  pages={1-28}
}

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

View on Springer

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed