Author:
Chazelle Bernard,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
Reference29 articles.
1. P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting distances in the plane,Proc. 6th ACM Symp. on Computational Geometry, 1990, pp. 321–331. Also inAlgorithmica 9 (1993), 495–514.
2. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minium spanning trees and bichromatic closest pairs,Discrete Comput. Geom. 6 (1991), 407–422.
3. P. K. Agarwal, A. Efrat, M. Sharir, and S. Toledo, Computing a segment center for a planar point set,J. Algorithms, to appear.
4. P. K. Agarwal and J. Matoušek, Ray shooting and parametric search,Proc. 24th Ann. ACM Symp. on Theory of Computing, 1992, pp. 517–526.
5. P. K. Agarwal and M. Sharir, Planar geometric location problems.Proc. 2nd ACM Symp. on Discrete Algorithms, 1991, pp. 449–458. (Also to appear inAlgorithmica.)
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献