Author:
Aleksandrov Lyudmil,Lanthier Mark,Maheshwari Anil,Sack Jörg -R.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. L. Aleksandrov, M. Lanthier, A. Maheshwari and J.-R. Sack, “An ε-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces”, to appear 14th European Workshop on Computational Geometry, Barcelona, Spain, 1998.
2. J. Choi, J. Sellen and C.K. Yap, “Approximate Euclidean Shortest Path in 3-Space”, Proc. 10th Annual Symp. on Computational Geometry, 1994, pp. 41–48.
3. G. Das and G. Narasimhan, “Short Cuts in Higher Dimensional Space”, Proceedings of the 7th Annual Canadian Conference on Computational Geometry, Québec City, Québec, 1995, pp. 103–108.
4. M.L. Fredman and R.E. Tarjan, “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms”, J. ACM, 34(3), 1987, pp.596–615.
5. J. Goodman and J. O'Rourke, Eds., Handbook of Discrete and Computational Geometry, CRC Press LLC, Chapter 24, 1997, pp. 445–466.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献