Near-Optimal Generalisations of a Theorem of Macbeath

被引:7
作者
Mustafa, Nabil H. [1 ]
Ray, Saurabh [2 ]
机构
[1] Univ Paris Est, Lab Informat Gaspard Monge, Paris, France
[2] New York Univ Abu Dhabi, Dept Comp Sci, Abu Dhabi, U Arab Emirates
来源
31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014) | 2014年 / 25卷
关键词
Epsilon Nets; Cuttings; Union Complexity; Geometric Set systems; Convex Geometry; EPSILON-NETS; CONVEX-BODIES;
D O I
10.4230/LIPIcs.STACS.2014.578
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The existence of Macbeath regions is a classical theorem in convex geometry ("A Theorem on non-homogeneous lattices", Annals of Math, 1952). We refer the reader to the survey of I. Barany for several applications [3]. Recently there have been some striking applications of Macbeath regions in discrete and computational geometry. In this paper, we study Macbeath's problem in a more general setting, and not only for the Lebesgue measure as is the case in the classical theorem. We prove near-optimal generalizations for several basic geometric set systems. The problems and techniques used are closely linked to the study of c-nets for geometric set systems.
引用
收藏
页码:578 / 589
页数:12
相关论文
共 20 条
[1]   SMALL-SIZE ε-NETS FOR AXIS-PARALLEL RECTANGLES AND BOXES [J].
Aronov, Boris ;
Ezra, Esther ;
Sharir, Micha .
SIAM JOURNAL ON COMPUTING, 2010, 39 (07) :3248-3282
[2]  
Arya S., 2012, P 28 ANN ACM S COMP, P363, DOI 10.1145/2261250.2261305
[3]   CONVEX-BODIES, ECONOMIC CAP COVERINGS, RANDOM POLYTOPES [J].
BARANY, I ;
LARMAN, DG .
MATHEMATIKA, 1988, 35 (70) :274-291
[4]  
Bárány I, 2007, LECT NOTES MATH, V1892, P77
[5]   HOW HARD IS HALF-SPACE RANGE SEARCHING [J].
BRONNIMANN, H ;
CHAZELLE, B ;
PACH, J .
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 10 (02) :143-155
[6]  
Chan T. M., 2012, SODA
[7]   On the Set Multi-Cover Problem in Geometric Settings [J].
Chekuri, Chandra ;
Clarkson, Kenneth L. ;
Har-Peled, Sariel .
PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, :341-350
[8]   DIRECTIONS OF LINE SEGMENTS AND OF R-DIMENSIONAL BALLS ON BOUNDARY OF A CONVEX BODY IN EUCLIDEAN SPACE [J].
EWALD, G ;
LARMAN, DG ;
ROGERS, CA .
MATHEMATIKA, 1970, 17 (33) :1-&
[9]   EPSILON-NETS AND SIMPLEX RANGE QUERIES [J].
HAUSSLER, D ;
WELZL, E .
DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) :127-151
[10]   ALMOST TIGHT BOUNDS FOR EPSILON-NETS [J].
KOMLOS, J ;
PACH, J ;
WOEGINGER, G .
DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 7 (02) :163-173