Author:
Aggarwal Alok,Moran Shlomo,Shor Peter W.,Suri Subhash
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Aggarwal and S. Suri, "An Efficient Algorithm for Computing the Farthest Visible pair in a Simple Polygon," Manuscript in preparation, 1989.
2. A. Aggarwal, M. Klawe, S. Moran, P. W. Shor, and R. Wilber, "Geomteric Applications of a Matrix Searching Algorithm," Algorithmica, Vol. 2, No. 2, pp. 195–208, 1986.
3. B. Bhattacharya and H. El Gindy, "A New Linear Convex Hull Algorithm for Simple Polygon," IEEE Trans. on Information Theory, Vol. C-29, pp. 571–573, 1984.
4. B. M. Chazelle, "A Theorem for Polygon Cutting with Applications," Proc. of the 23rd IEEE Annual Symposium on the Foundations of Computer Science, pp. 339–349, 1983.
5. B. M. Chazelle and L. J. Guibas, "Visibility and intersection Problems in Plane Geometry," Proc. of the First ACM Annual Symposium on Computational Geometry, pp. 135–146, 1985.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献