Unconstrained and curvature-constrained shortest-path distances and their approximation
DOI10.1007/s00454-019-00060-7zbMath1418.53045arXiv1706.09441OpenAlexW2962980685MaRDI QIDQ2421590
Ery Arias-Castro, Thibaut Le Gouic
Publication date: 17 June 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.09441
curvatureshortest pathsmotion planningneighborhood graphreachminimizing curvesintrinsic distancesapproximation of distances
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Geodesics in global differential geometry (53C22) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Riemannian obstacle problem
- Uniform convergence of discrete curvatures from nets of curvature lines
- Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
- Optimal paths for a car that goes both forwards and backwards
- Finding the homology of submanifolds with high confidence from random samples
- Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
- Curvature Measures
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- Engineering Route Planning Algorithms
- Geodesics in Euclidean Space with Analytic Obstacle
- Planning Algorithms
- Topology
This page was built for publication: Unconstrained and curvature-constrained shortest-path distances and their approximation