On Approximating Shortest Paths in Weighted Triangular Tessellations

  title={On Approximating Shortest Paths in Weighted Triangular Tessellations},
  author={Prosenjit Bose and Guillermo Esteban and David Orden and Rodrigo I. Silveira},
We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional space, we study three types of shortest paths: a weighted shortest path SPw (s, t), which is a shortest path from s to t in the space; a weighted shortest vertex path SVPw (s, t), which is a shortest path where the vertices of the path are vertices of the tessellation; and a… 


Determining approximate shortest paths on weighted polyhedral surfaces
This algorithm is based on a novel way of discretizing polyhedral surfaces and utilizes a generic greedy approach for computing shortest paths in geometric graphs obtained by such discretization.
Approximation algorithms for geometric shortest path problems
We consider the classical geometric problem of determining a shortest path through a weighted domain. We present approximation algorithms that compute e-short paths, i.e., paths whose costs are
Triangulation Refinement and Approximate Shortest Paths in Weighted Regions
This work presents a fully polynomial-time approximation scheme that finds a (1 + e)-approximate shortest path between two given points in T in O ([EQUATION]) time, where k is the smallest integer such that the sum of the k smallest angles in T is at least π.
Shortest path queries among weighted obstacles in the rectilinear plane
This work improves and generalizes the previously best-known results on computing rectilinear shortest paths among weighted polygonal obstacles and applies the techniques to processing twopoint L1 shortest obstacle-avoiding path queries among arbitrary (i.e., not necessarily rectil inear) polygonnal obstacles in the plane.
The weighted region problem: finding shortest paths through a weighted planar subdivision
An algorithm that constructs a (restricted) “shortest path map” with respect to a given source point is presented and exploits the fact that shortest paths obey Snell's Law of Refraction at region boundaries, a local optimaly property of shortest paths that is well known from the analogous optics model.
Path Planning on Grids: The Effect of Vertex Placement on Path Length
It is shown that, for both vertex and grid paths on both 4-neighbor and 8-neIGHbor grids, placing vertices at cell corners rather than at cell centers tends to result in shorter paths.
Path planning in 0/1/ weighted regions with applications
This work considers the terrain navigation problem in a two-dimensional polygonal subdivision consisting of obstacles, “free” regions, and regions in which cost is proportional to distance traveled and presents an exact algorithm and faster algorithms for the cases of convex free regions and/or obstacles.
Shortest Paths and Networks
We survey various forms of the problem, primarily in two and three dimensions, for motion of a single point, since most results have focused on these cases. We discuss shortest paths in a simple
Detecting Weakly Simple Polygons
An algorithm to determine whether a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time is described, improving an earlier O( n3)-time algorithm of Cortese et al.