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 条
  • [21] Near-Optimal Weighted Matrix Completion
    Lopez, Oscar
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [22] Near-Optimal Distributed Tree Embedding
    Ghaffari, Mohsen
    Lenzen, Christoph
    DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 197 - 211
  • [23] Safe Learning for Near-Optimal Scheduling
    Busatto-Gaston, Damien
    Chakraborty, Debraj
    Guha, Shibashis
    Perez, Guillermo A.
    Raskin, Jean-Francois
    QUANTITATIVE EVALUATION OF SYSTEMS (QEST 2021), 2021, 12846 : 235 - 254
  • [24] Statistically Near-Optimal Hypothesis Selection
    Bousquet, Olivier
    Braverman, Mark
    Kol, Gillat
    Efremenko, Klim
    Moran, Shay
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 909 - 919
  • [25] Near-Optimal Separators in String Graphs
    Matousek, Jiri
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (01): : 135 - 139
  • [26] Near-Optimal (Euclidean) Metric Compression
    Indyk, Piotr
    Wagner, Tal
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 710 - 723
  • [27] Analysis of Near-Optimal Evacuation Instructions
    Huibregtse, Olga L.
    Bliemer, Michiel C. J.
    Hoogendoorn, Serge P.
    1ST CONFERENCE ON EVACUATION MODELING AND MANAGEMENT, 2010, 3 : 189 - 203
  • [28] A near-optimal mechanism for impartial selection
    Bousquet, Nicolas
    Norin, Sergey
    Vetta, Adrian
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8877 : 133 - 146
  • [29] A CLASS OF NEAR-OPTIMAL JPDA ALGORITHMS
    ROECKER, JA
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1994, 30 (02) : 504 - 510
  • [30] Near-Optimal Auctions on Independence Systems
    Ammann, Sabrina C. L.
    Stiller, Sebastian
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (05) : 1160 - 1179