Article

Finding shortest paths in the presence of orthogonal obstacles using a combined L₁ and link metric

Authors:

M. T. de Berg,

M. J. van Kreveld,

B. J. Nilsson,

M. H. OvermarsAuthors Info & Claims

SWAT '90: Proceedings of the second Scandinavian workshop on Algorithm theory

Pages 213 - 224

Published: 01 July 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Lee DYang CWong C(1994)On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection ModelIEEE Transactions on Computers10.1109/12.28630443:6(711-724)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1109/12.286304
de Berg Mvan Kreveld MNilsson BDrysdale R(1991)Shortest path queries in rectilinear worlds of higher dimension (extended abstract)Proceedings of the seventh annual symposium on Computational geometry10.1145/109648.109654(51-60)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109654

Index Terms

Recommendations

Finding non-dominated bicriteria shortest pairs of disjoint simple paths

In this paper we introduce a method to compute non-dominated bicriteria shortest pairs, each including two disjoint simple paths. The method is based on an algorithm for ranking pairs of disjoint simple paths by non-decreasing order of cost, that is an ...
Finding next-to-shortest paths in a graph

We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u,v)-path is a shortest (u,v)-path amongst (u,v)-paths with length strictly greater than the length of the shortest (u,v)-path. In contrast to the situation in ...
Improved algorithm for finding next-to-shortest paths

We study the problem of finding the next-to-shortest paths in a weighted undirected graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)-paths with length strictly greater than the length of the shortest (u, v)-path. The first ...

Comments

Information & Contributors

Information

Published In

SWAT '90: Proceedings of the second Scandinavian workshop on Algorithm theory

July 1990

417 pages

ISBN:0387528466

Editors:
John R. Gilbert
Xerox Palo Alto Research Center and Univ. of Bergen, Palo Alto, CA
,
Rolf Karlsson
Lund Univ., Lund, Sweden

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lee DYang CWong C(1994)On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection ModelIEEE Transactions on Computers10.1109/12.28630443:6(711-724)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1109/12.286304
de Berg Mvan Kreveld MNilsson BDrysdale R(1991)Shortest path queries in rectilinear worlds of higher dimension (extended abstract)Proceedings of the seventh annual symposium on Computational geometry10.1145/109648.109654(51-60)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109654

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Finding non-dominated bicriteria shortest pairs of disjoint simple paths

Finding next-to-shortest paths in a graph

Improved algorithm for finding next-to-shortest paths

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations