Author:
Agarwal Pankaj K.,Aronov Boris,Sharir Micha,Suri Subhash
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. P. K. Agarwal and M. Sharir, Planar geometric location problems, Technical Report 90-58, DIMACS, Rutgers University, New Brunswick, NJ, August 1990. (Also to appear inAlgorithmica).
2. J. L. Bentley and T. Ottmann, Algorithms for reporting and counting geometric intersections,IEEE Trans. Comput. 28 (1979), 643?647.
3. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection,J. Comput. System Sci. 7 (1973), 448?461.
4. B. Chazelle, Some techniques for geometric searching with implicit set representations,Acta Inform.24 (1987), 565?682.
5. B. Chazelle and D. T. Lee, On a circle placement problem,Computing 1 (1968), 1?16.
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献