Fly Cheaply: On the Minimum Fuel Consumption Problem

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 330-337

  Chan, Timothy M ^a   Efrat, Alon ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347156624     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1189     Document Type: Article

References (8)

1. P. K. Agarwal, A. Efrat, and M. Sharir, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, SIAM J. Comput. 29 (2000), 912-953.
2. P. K. Agarwal, O. Schwarzkopf, and M. Sharir, The overlay of lower envelopes and its applications, Discrete Comput. Geom. 15 (1996), 1-13.
3. S. Baase, "Computer Algorithms: Introduction to Design and Analysis," 2nd ed., Addison-Wesley, Reading, MA, 1988.
4. D. Eppstein, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete Comput. Geom. 13 (1995), 111-122.
5. J. E. Goodman and J. O'Rourke, Eds., "Handbook of Discrete and Computational Geometry," CRC Press, Boca Raton, FL, 1997.
6. D. Halperin and M. Sharir, New bounds for lower envelopes in three dimensions, with applications to visibility in terrains, Discrete Comput. Geom. 12 (1994), 313-326.
7. J. Mitchell, Geometric shortest paths and network optimization, "Handbook of Computational Geometry" (J.-R. Sack and J. Urrutia, Eds.), Elsevier, Amsterdam/New York, 2000.
8. M. Thorup, Undirected single source shortest path in linear time, in "Proceedings of the 38th Annual IEEE Symposium Found. Computer Science (FOCS), 1997," pp. 12-21.