arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.09441cs.CGmath.MG
收藏

无约束和曲率约束的最短路距离及其逼近

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

Ery Arias-Castro, Thibaut Le Gouic

摘要:

我们研究最短路径和它们的距离上的一个子集的欧几里得空间,和他们的近似等价物在一个邻域图上定义的样本从该子集。特别是,我们恢复并扩展了Bernstein等人(2000)的结果。我们对曲率约束的最短路径和它们的距离做同样的事情,建立我们认为是它们的第一近似界。

英文摘要:

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. (2000). We do the same with curvature-constrained shortest paths and their distances, establishing what we believe are the first approximation bounds for them.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑