Author:
Matoušek Jiří,Schwarzkopf Otfried
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference24 articles.
1. [AESW] P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs.Discrete & Computational Geometry, 6:407–422, 1991.
2. [AM1] P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Technical Report CS-1991-43, Duke University, 1991.
3. [AM2] P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. InProc. 24th ACM Symposium on Theory of Computing, pages 517–526, 1992. Full version as Technical Report CS-1991-22, Duke University, 1991.
4. [BS] J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation.Journal of Algorithms, 1:301–358, 1980.
5. [BC] H. Brönnimann and B. Chazelle. How hard is halfspace range searching? InProc. 8th Symposium on Computational Geometry, pages 271–275, 1992.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献