Author:
Paterson Michael S.,Yao F. Frances
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference17 articles.
1. B. Chazelle, Intersecting is easier than sorting,Proc. 16th Ann. ACM Symp. on Theory of Computing, 1983, 125–134.
2. B. Chazelle, L. Guibas, and D. Lee, The power of geometric duality,BIT 25, 1985, 76–90.
3. D. Dobkin, L. Guibas, J. Hershberger, and J. Snoeyink, An efficient algorithm for finding the CSG representation of a simple polygon,Computer Graphics 22, 1988, 31–40.
4. H. Edelsbrunner,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
5. D. Eppstein, Private communication.
Cited by
119 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献