Author:
Mustafa Nabil H.,Ray Saurabh
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Point selections and weak ε-nets for convex hulls;Alon;Combin., Probab. & Comput.,1992
2. Piercing convex sets and the Hadwiger–Debrunner (p,q)-problem;Alon;Adv. Math.,1992
3. Centerpoints and Tverberg’s technique;Basit;Comput. Geom.,2010
4. A generalization of Carathéodory’s theorem;Bárány;Discrete Math.,1982
5. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Improved bounds on weak ε-nets for convex sets, in Proceedings of The Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993, pp. 495–504.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Colorful Carathéodory, Helly and Sierksma numbers of convexity spaces;Bulletin of the Belgian Mathematical Society - Simon Stevin;2022-05-01
2. The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg;Bulletin of the American Mathematical Society;2019-01-25
3. On a Problem of Danzer;Combinatorics, Probability and Computing;2018-10-15