arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.1364cs.CGcs.DS
收藏

最短下降路径的一种近似算法

An Approximation Algorithm for Shortest Descending Paths

Mustaq Ahmed, Anna Lubiw

摘要:

在一个多面体地形上从s到t的路径是下降的,如果当我们沿着从s到t的路径移动p时,点p的高度永远不会增加。在多面体地形中,没有有效的算法来找到从s到t的最短下降路径(SDP)。我们给出了一个简单的近似算法,解决了一般地形上的SDP问题。我们的算法用O(n^2 X / e)Steiner点离散地形,这样在对给定顶点s进行O(n^2 X / e * log(n X /e))时间的预处理阶段之后,如果v是地形的顶点或Steiner点,我们可以在O(n)时间内确定从s到任何点v的(1+e)-近似SDP,否则在O(n X /e)时间内。这里n是地形的大小,X是地形的几何参数。

英文摘要:

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give a simple approximation algorithm that solves the SDP problem on general terrains. Our algorithm discretizes the terrain with O(n^2 X / e) Steiner points so that after an O(n^2 X / e * log(n X /e))-time preprocessing phase for a given vertex s, we can determine a (1+e)-approximate SDP from s to any point v in O(n) time if v is either a vertex of the terrain or a Steiner point, and in O(n X /e) time otherwise. Here n is the size of the terrain, and X is a parameter of the geometry of the terrain.

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

↑