Author:
Matoušek J.,Sharir M.,Welzl E.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference34 articles.
1. N. Amenta, Helly-type theorems and generalized linear programming,Discrete Comput. Geom.,12 (1994), 241–261.
2. N. Amenta, Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem,Proc. 10th Annual ACM Symposium on Computational Geometry, 1994, pp. 340–347.
3. D. E. Bell, A theorem concerning the integer lattice,Stud. Appl. Math.,56 (1977), 187–188.
4. B. Chazelle and J. Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimensions, Technical Report B 92-18, Dept. of Mathematics, Freie Universität Berlin (1992); alsoProc. 4th SIAM-ACM Symposium on Discrete Algorithms, 1993, pp. 281–290.
5. K. L. Clarkson, Linear programming inO(n × 3d 2) time,Inform. Process. Lett.,22 (1986), 21–24.
Cited by
170 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献