An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments (1997) [8 citations — 2 self]
by
David Eppstein
,
David Hart
In Proc. 5th Worksh. Algorithms and Data Structures
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Eppstein97anefficient,
author = {David Eppstein and David Hart},
title = {An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments},
booktitle = {In Proc. 5th Worksh. Algorithms and Data Structures},
year = {1997},
pages = {234--247},
publisher = {Springer-Verlag}
}
author = {David Eppstein and David Hart},
title = {An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments},
booktitle = {In Proc. 5th Worksh. Algorithms and Data Structures},
year = {1997},
pages = {234--247},
publisher = {Springer-Verlag}
}
Bookmarks
OpenURL
Abstract:
. Suppose one has a line segment arrangement consisting entirely
Citations
| 404 | Computational geometry – Shamos - 1978 |
| 99 | Faster shortest-path algorithms for planar graphs – Henzinger, Klein, et al. - 1997 |
| 23 | 1991], Triangulating polygons without large angles, preprint – Bern, Dobkin, et al. |
| 21 | Rectilinear paths among rectilinear obstacles – Lee, Yang, et al. - 1996 |
| 9 | Rectilinear shortest paths in the presence of rectangular barriers – Rezende, Lee, et al. - 1989 |
| 8 | Approximating shortest paths in arrangements of lines – Bose, Evans, et al. - 1996 |
| 4 | Efficient algorithms for finding disjoint paths in grids – Chan, Chin - 1997 |
| 1 | Efficient computation of Euclidian shortest paths in the plane – Hershberger, Suri - 1993 |
