Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference45 articles.
1. P. K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number,Proceedings of the 5th Annual Symposium on Computational Geometry, 1989, pp. 315–325.
2. P. K. Agarwal, Intersection and decomposition algorithms for arrangements of curves in the plane, Ph.D. Thesis, Dept. Computer Science, New York University, New York, August 1989.
3. P. K. Agarwal, Partitioning arrangements of lines: I. An efficient deterministic algorithm,Discrete and Computational Geometry, this issue (1990), 449–483.
4. P. K. Agarwal and M. Sharir, Red-blue intersection detection algorithms with applications to motion planning and collision detection,SIAM Journal of Computing 19 (1990), 297–322.
5. B. Aronov, H. Edelsbrunner, L. Guibas, and M. Sharir, Improved bounds on the complexity of many faces in arrangements of segments, Technical Report 459, Dept. Computer Science, New York University, July 1989.
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献