CUTTING HYPERPLANE ARRANGEMENTS

被引:61
|
作者
MATOUSEK, J
机构
[1] Department of Applied Mathematics, Charles University, Praha 1, 118 00
关键词
D O I
10.1007/BF02574697
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider a collection H of n hyperplanes in E(d) (where the dimension d is fixed). An epsilon-cutting for H is a collection of (possibly unbounded) d-dimensional simplices with disjoint interiors, which cover all E(d) and such that the interior of any simplex is intersected by at most epsilon-n hyperplanes of H. We give a deterministic algorithm for finding a (1/r)-cutting with O(r(d)) simplices (which is asymptotically optimal). For r less-than-or-equal-to n 1-delta, where delta > 0 is arbitrary but fixed, the running time of this alogorithm is O(n(log n)O(1)r(d-1)). In the plane we achieve a time bound O(nr) for r less-than-or-equal-to n 1-delta, which is optimal if we also want to compute the collection of lines intersecting each simplex of the cutting. This improves a result of Agarwal, and gives a conceptually simpler algorithm. For an n point set X is-contained-in-or-equal-to E(d) and a parameter r, we can deterministically compute a (1/r)-net of size O(r log r) for the range space (X, {X intersection R; R is a simplex}), in time O(n(log n)O(1)r(d-1) + r(O(1)). The size of the (1/r)-net matches the best known existence result. By a simple transformation, this allows us to find epsilon-nets for other range spaces usually encountered in computational geometry. These results have numerous applications for derandomizing algorithms in computational geometry without affecting their running time significantly.
引用
下载
收藏
页码:385 / 406
页数:22
相关论文
共 50 条
  • [31] On contact loci of hyperplane arrangements
    Budur, Nero
    Tran Quang Tue
    ADVANCES IN APPLIED MATHEMATICS, 2022, 132
  • [32] Hyperplane arrangements in preference modeling
    Ovchinnikov, S
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2005, 49 (06) : 481 - 488
  • [33] Bisecting measures with hyperplane arrangements
    Hubard, Alfredo
    Karasev, Roman
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2020, 169 (03) : 639 - 647
  • [34] Lefschetz properties and hyperplane arrangements
    Palezzato, Elisa
    Torielli, Michele
    JOURNAL OF ALGEBRA, 2020, 555 : 289 - 304
  • [35] More Bisections by Hyperplane Arrangements
    Pavle V. M. Blagojević
    Aleksandra Dimitrijević Blagojević
    Roman Karasev
    Jonathan Kliem
    Discrete & Computational Geometry, 2022, 67 : 33 - 64
  • [36] ON THE ZONE THEOREM FOR HYPERPLANE ARRANGEMENTS
    EDELSBRUNNER, H
    SEIDEL, R
    SHARIR, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 555 : 108 - 123
  • [37] Branched Polymers and Hyperplane Arrangements
    Karola Mészáros
    Alexander Postnikov
    Discrete & Computational Geometry, 2013, 50 : 22 - 38
  • [38] ON THE ZONE THEOREM FOR HYPERPLANE ARRANGEMENTS
    EDELSBRUNNER, H
    SEIDEL, R
    SHARIR, M
    SIAM JOURNAL ON COMPUTING, 1993, 22 (02) : 418 - 429
  • [39] More Bisections by Hyperplane Arrangements
    Blagojevic, Pavle V. M.
    Blagojevic, Aleksandra Dimitrijevic
    Karasev, Roman
    Kliem, Jonathan
    DISCRETE & COMPUTATIONAL GEOMETRY, 2022, 67 (01) : 33 - 64
  • [40] Deformations of Coxeter hyperplane arrangements
    Postnikov, A
    Stanley, RP
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2000, 91 (1-2) : 544 - 597