Author:
Edelsbrunner Herbert,Guibas Leonidas,Sharir Micha
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference19 articles.
1. P. K. Agarwal, Intersection and decomposition algorithms for arrangements of curves in the plane, Ph.D. Dissertation, Computer Science Department, New York University, June 1989.
2. B. Aronov and M. Sharir, Triangles in space, or: Building and analyzing castles in the air,Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 381–391.
3. R. J. Canham, A theorem on arrangements of lines in the plane,Israel J. Math. 7 (1969), 393–397.
4. B. Chazelle, How to search in history,Inform. and Control 64 (1985), 77–99.
5. K. Clarkson, A probabilistic algorithm for the post office problem,Proc. 17th ACM Symp. on Theory of Computing, 1985, pp. 75–84.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献