Author:
Djidjev Hristo N.,Lingas Andrzej,Sack Jörg-Rüdiger
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. Lecture Notes in Computer Science;H. Djidjev,1988
3. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica
2 (1987), 209–233.
4. W. Lenhart, R. Pollack, J.-R. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides, and C. Yap, Computing the link center of a simple polygon, Proc. 3rd ACM Conference on Computational Geometry (1987), 1–10; Discrete and Computational Geometry
3, 3 (1988), 281–293.
5. R.J. Lipton, and R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math.
36 (1979), 177–189.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献