Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference12 articles.
1. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra.Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 38?48.
2. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane.J. Assoc. Comput. Mech.,39 (1992), 1?54.
3. R. F. Cohen and R. Tamassia. Dynamic expression trees and their applications.Proceedings of the 2nd ACM/SIAM Symposium on Discrete Algorithms, 1991, pp. 52?61.
4. D. Dobkin, L. Guibas, J. Hershberger, and J. Snoeyink. An efficient algorithm for finding the CSG representation of a simple polygon.Comput. Graphics,22 (1988), 31?40.
5. LNCS, Vol. 140;D. P. Dobkin,1982
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献