Author:
Aleksandrov Lyudmil,Djidjev Hristo N.,Guo Hua,Maheshwari Anil,Nussbaum Doron,Sack Jörg-Rüdiger
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference40 articles.
1. Agarwal, P.K., Aronov, B., O’Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput. 26(6), 1689–1713 (1997)
2. Agarwal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K.: Approximate shortest paths on a convex polytope in three dimensions. J. ACM 44(4), 567–584 (1997)
3. Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate shortest paths on convex polytopes. Algorithmica 33(2), 227–242 (2002)
4. Aleksandrov, L., Djidjev, H.: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math. 9(1), 129–150 (1996)
5. Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An ε-approximation algorithm for weighted shortest path queries on polyhedral surfaces. In: Proc. 14th Euro CG Barcelona, pp. 19–21 (1998)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献