Author:
Rappaport David,Imai Hiroshi,Toussaint Godfried T.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference16 articles.
1. D. Avis and D. Rappaport, Computing monotone simple circuits in the plane, inComputational Morphology (G. Toussaint, ed.), 13–23, North-Holland, Amsterdam (1988).
2. J. L. Bentley and T. A. Ottmann, Algorithms for reporting and counting geometric intersections,IEEE Trans. Comput. 28, 9 (1979), 643–647.
3. N. Friedman, Some results on the effect of arithmetics on comparison problems,Proc. 13th IEEE Symp. Switching Automata Theory (1972), 139–142.
4. M. R. Garey, D. S. Johnson, and R. E. Tarjan, The planar Hamiltonian circuit problem is NP-complete,SIAM J. Comput. 5 (1976), 704–714.
5. R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set,Inform. Process. Lett. 1 (1972), 132–133.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献