<italic>We present an algorithm for determining the shortest path between a source and a destination through a planar subdivision in which each region has an associated weight. Distances are measured according to a weighted Euclidean metric: Each region of the subdivision has associated with it a weight, and the weighted distance between two points in a convex region is the product of the corresponding weight and the Euclidean distance between them. Our algorithm runs in time &Ogr;</italic>(<italic>n</italic><supscrpt>7</supscrpt> <italic>L</italic>) <italic>and requires &Ogr;</italic>(<italic>n</italic><supscrpt>3</supscrpt>) <italic>space, where n is the number of edges of the subdivision, and L is the precision of the problem instance (including the number of bits in a user-specified tolerance ∈, which is the percentage the solution is allowed to differ from an optimal solution). The algorithm uses the fact that shortest paths obey Snell's Law of Refraction at region boundaries, a local optimality property of shortest paths that is well-known from the analogous optics model.</italic>
[1]
Edsger W. Dijkstra,et al.
A note on two problems in connexion with graphs
,
1959,
Numerische Mathematik.
[2]
Der-Tsai Lee.
Proximity and reachability in the plane.
,
1978
.
[3]
D. T. Lee,et al.
Euclidean shortest paths in the presence of rectilinear barriers
,
1984,
Networks.
[4]
Micha Sharir,et al.
On shortest paths in polyhedral spaces
,
1986,
STOC '84.
[5]
David M. Keirsey,et al.
Planning Strategic Paths Through Variable Terrain Data
,
1984,
Other Conferences.
[6]
J. Reif,et al.
Shortest Paths in Euclidean Space with Polyhedral Obstacles.
,
1985
.
[7]
Francis Quek,et al.
A Decision System For Autonomous Robot Navigation Over Rough Terrain
,
1985,
Other Conferences.
[8]
Micha Sharir,et al.
On Shortest Paths in Polyhedral Spaces
,
1986,
SIAM J. Comput..