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
关键词
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
相关论文
共 50 条
  • [41] Near-optimal Individualized Treatment Recommendations
    Meng, Haomiao
    Zhao, Ying-Qi
    Fu, Haoda
    Qiao, Xingye
    JOURNAL OF MACHINE LEARNING RESEARCH, 2020, 21
  • [42] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING
    GAREY, MR
    JOHNSON, DS
    JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49
  • [43] Near-optimal parallel prefetching and caching
    Kimbrel, T
    Karlin, AR
    SIAM JOURNAL ON COMPUTING, 2000, 29 (04) : 1051 - 1082
  • [44] Near-Optimal Instruction Selection on DAGs
    Koes, David Ryan
    Goldstein, Seth Copen
    CGO 2008: SIXTH INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, PROCEEDINGS, 2008, : 45 - 54
  • [45] Near-optimal parallel prefetching and caching
    Kimbrel, T
    Karlin, AR
    37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 540 - 549
  • [46] Near-optimal compression for compressed sensing
    Saab, Rayan
    Wang, Rongrong
    Yilmaz, Ozgur
    2015 DATA COMPRESSION CONFERENCE (DCC), 2015, : 113 - 122
  • [47] A Near-Optimal Mechanism for Impartial Selection
    Bousquet, Nicolas
    Norin, Sergey
    Vetta, Adrian
    WEB AND INTERNET ECONOMICS, 2014, 8877 : 133 - 146
  • [48] Generating Near-Optimal Survivable Topologies
    Morais, Rui Manuel
    Monteiro, Paulo
    Pinto, Armando Nolasco
    2012 14TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON 2012), 2012,
  • [49] On some classes of optimal and near-optimal polynomial codes
    Aydin, N
    Ray-Chaudhuri, DK
    FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (01) : 24 - 35
  • [50] Near-optimal controls: Stochastic case
    Zhou, XY
    PROCEEDINGS OF THE 35TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 1996, : 646 - 647