On the number of shortest descending paths on the surface of a convex terrain

Journal of Discrete Algorithms - Tập 9 - Trang 182-189 - 2011
Mustaq Ahmed1, Anil Maheshwari2, Subhas C. Nandy3, Sasanka Roy4
1Google Inc., Mountain View, CA, USA
2School of Computer Science, Carleton University, Ottawa, Canada
3Indian Statistical Institute, Kolkata, India
4Chennai Mathematical Institute, Chennai, India

Tài liệu tham khảo

Ahmed, 2010, Approximation algorithms for shortest descending paths in terrains, Journal of Discrete Algorithms, 8, 214, 10.1016/j.jda.2009.05.001 M. Ahmed, A. Lubiw, Properties of shortest descending paths, in: Fall Workshop on Computational and Combinatorial Geometry, November 2007. Ahmed, 2009, Shortest descending paths through given faces, Computational Geometry: Theory and Applications, 42, 464, 10.1016/j.comgeo.2007.10.011 M. Ahmed, A. Lubiw, Shortest descending paths: Towards an exact algorithm, International Journal of Computational Geometry and Applications, in press, www.cs.uwaterloo.ca/~m6ahmed/papers/Ahmed10-1.pdf, 2010. de Berg, 1997, Trekking in the Alps without freezing or getting tired, Algorithmica, 18, 306, 10.1007/PL00009159 Mitchell, 1987, Discrete geodesic problem, SIAM Journal on Computing, 16, 647, 10.1137/0216045 Mount, 1990, The number of shortest paths on the surface of a polyhedron, SIAM Journal on Computing, 19, 593, 10.1137/0219040 Roy, 2007, Shortest monotone descent path problem in polyhedral terrain, Computational Geometry Theory and Applications, 37, 115, 10.1016/j.comgeo.2006.06.003