Author:
Edelsbrunner Herbert,Guibas Leonidas J.,Sharir Micha
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference29 articles.
1. Agarwal, P. K. An efficient algorithm for partitioning arrangements of lines and its applications. InProc. 5th ACM Symp. Comput. Geom., 1989, pp. 11–22.
2. Aronov, B., Edelsbrunner, H., Guibas, L., and Sharir, M. Improved bounds on the number of edges of many faces in arrangements of line segments. Report UIUCDCS-R-89-1527, Department of Computer Science, University of Illinois, Urbana, Illinois, 1989.
3. Aronov, B., and Sharir, M. Triangles in space, or: Building (and analyzing) castles in the air. InProc. 4th ACM Symp. Comput. Geom., 1988, pp. 381–391.
4. Bentley, J. L., and Ottmann, T. A. Algorithms for reporting and counting geometric intersections.IEEE Trans. Comput. 28 (1979), 643–647.
5. Canham, R. J. A theorem on arrangements of lines in the plane.Isreal J. Math. 7 (1969), 393–397.
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献