Author:
Agarwal Pankaj K.,Edelsbrunner Herbert,Schwarzkopf Otfried,Welzl Emo
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference21 articles.
1. [AESW] P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, Euclidean minimum spanning trees and bichromatic closest pairs,Proceedings of the 6th Annual ACM Symposium on Computational Geometry, 1990, pp. 203–210.
2. [AM] P. K. Agarwal and J. Matoušek, Personal communication.
3. [Ch] B. Chazelle, How to search in history,Information and Control 64 (1985), 77–99.
4. Report UIUCDCS-R-90-1578;B. Chazelle,1990
5. [CEG+] K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres,Discrete & Computational Geometry 5 (1990), 99–160.
Cited by
87 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献