An efficient algorithm for shortest paths in vertical and horizontal segments

David Eppstein and David Hart
Proc. 5th Worksh. Algorithms and Data Structures (WADS 1997), Lecture Notes in Computer Science 1272, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rudiger Sack, and Roberto Tamassia, ed., Springer-Verlag, Aug 1997, pp. 234–247

Cited by:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!