Approximating the shortest path in line arrangements (2002) [3 citations — 0 self]
by David Hart
In Proc. 14th Canad. Conf. Computational Geometry
http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/short/dhart-59460.ps
Add To MetaCart
Abstract:
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. The best known time bound for computing this is O(n 2). We develop an algorithm that finds a 1 + ffl approximation of the shortest path in time O(n log n + (minfn;
Citations
| 14 | Unsolvable Problems – Davis - 1977 |
| 8 | Approximating shortest paths in arrangements of lines – Bose, Evans, et al. - 1996 |
| 7 | An efficient algorithm for shortest paths in vertical and horizontal segments – Eppstein, Hart - 1997 |
| 4 | Shortest paths in an arrangement with k-orientations – Eppstein, Hart - 1999 |
| 2 | Finding an optimal path without growing the tree – Chen, Daescu, et al. - 1998 |
