Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Information Systems,Theoretical Computer Science,Software
Reference12 articles.
1. J. L. Bentley and T. A. Ottmann, Algorithms for reporting and counting geometric intersections,IEEE Trans. Computers C-28:643?647 (September 1979).
2. B. M. Chazelle, Computational geometry and convexity, Ph.D. thesis, Carnegie-Mellon University (July 1980).
3. B. Chazelle and D. Dobkin, Detection is easier than computation, inACM Symposium on Theory of Computing, Los Angles, California, 146?153 (May 1980).
4. B. Dasarathy and L. J. White, On some maximum location and classifier problems, in Computer Science Conference, Washington, D.C. (1975) (unpublished lecture).
5. D. Kirkpatrick, Optimal search in planar subdivisions,SIAM J. Computing 12(1):28?35 (February 1983).
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献