Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path between a pair of points, called source (s) and destination (t) such that the path is constrained to lie on the surface of the terrain, and for every pair of points p=(x(p),y(p),z(p)) and q=(x(q),y(q),z(q)) on the path, if dist(s,p)展开▼
机译:给定具有n个顶点的多面体地形,最短的单调下降路径问题用于查找一对称为源(s)和目的地(t)的点之间的最短路径,从而使该路径被约束为位于地形表面上,对于路径上的每对点p =(x(p),y(p),z(p))和q =(x(q),y(q),z(q)),如果dist (s,p)<dist(s,q),则z(p)≥z(q),其中,dist(s,p)表示p沿着上述路径与s的距离。这是Berg和Kreveld [M. de Berg,M。van Kreveld,《在阿尔卑斯山徒步旅行而不会冻结或不累》,Algorithica 18(1997)306–323]。我们表明,对于某些受限制的多面体地形类别,可以在多项式时间内确定最佳路径。
展开▼