Author:
Chen Danny Z.,Daescu Ovidiu,Klenk Kevin S.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Computing faces in segment and simplex arrangments. In Proceedings of the 27th Annual Symposium on the Theory of Computing. ACM, 29 May-1 June 1995.
2. E. M. Arkin, R. Connelly, and J. S. B. Mitchell. On monotone paths among obstacles, with applications to planning assemblies. In Proceedings of the 5th Annual Symposium on Computational Geometry, pages 334–343. ACM, June 1989.
3. O. Berkman and U. Vishkin. Finding level-ancestors in trees. Technical Report UMIACS-TR-91-9, University of Maryland, 1991.
4. D. Z. Chen, K. S. Klenk, and H.-Y. T. Tu. Shortest path queries among weighted obstacles in the rectilinear plane. In Proceedings of the Eleventh Annual Symposium on Computational Geometry, pages 370–379. ACM, 5–7 June 1995.
5. K. L. Clarkson, S. Kapoor, and P. M. Vaidya. Rectilinear shortest paths through polygonal obstacles in O(n log 32 n) time. Unpublished manuscript.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Minimum Link Monotone Path Problems;Journal of Computing and Information Science in Engineering;2011-08-01
2. Shortest Path Queries in Polygonal Domains;Algorithmic Aspects in Information and Management