Two disjoint 5-holes in point sets

被引:6
|
作者
Scheucher, Manfred [1 ]
机构
[1] Tech Univ Berlin, Inst Math, Berlin, Germany
关键词
Boolean satisfiability (SAT); Empty convex polygon; Erdos-Szekeres-type problem; MINIMUM SIZE; CONVEX QUADRILATERALS; HOLES;
D O I
10.1016/j.comgeo.2020.101670
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Given a set of points S subset of R-2, a subset X subset of S with vertical bar X vertical bar = k is called k gon if all points of X lie on the boundary of the convex hull of X, and k hole if, in addition, no point of S \ X lies in the convex hull of X. We use computer assistance to show that every set of 17 points in general position admits two disjoint 5-holes, that is, holes with disjoint respective convex hulls. This answers a question of Hosono and Urabe (2001). We also provide new bounds for three and more pairwise disjoint holes. In a recent article, Hosono and Urabe (2018) present new results on interior-disjoint holes - a variant, which also has been investigated in the last two decades. Using our program, we show that every set of 15 points contains two interior-disjoint 5-holes. Moreover, our program can be used to verify that every set of 17 points contains a 6-gon within significantly smaller computation time than the original program by Szekeres and Peters (2006). Another independent verification of this result was done by Maric (2019). (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] ON DISJOINT HOLES IN POINT SETS
    Scheucher, M.
    [J]. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 1049 - 1056
  • [2] Counting Non-Convex 5-Holes in a Planar Point Set
    Sung, Young-Hun
    Bae, Sang Won
    [J]. SYMMETRY-BASEL, 2022, 14 (01):
  • [3] On the minimum number of mutually disjoint holes in planar point sets
    Hosono, Kiyoshi
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09): : 661 - 672
  • [4] Specified holes with pairwise disjoint interiors in planar point sets
    Hosono, Kiyoshi
    Urabe, Masatsugu
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (01) : 7 - 15
  • [5] Covering point sets with two disjoint disks or squares
    Cabello, Sergio
    Diaz-Banez, J. Miguel
    Seara, Carlos
    Sellares, J. Antoni
    Urrutia, Jorge
    Ventura, Inmaculada
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 40 (03): : 195 - 206
  • [6] A superlinear lower bound on the number of 5-holes
    Aichholzer, Oswin
    Balko, Martin
    Hackl, Thomas
    Kyncl, Jan
    Parada, Irene
    Scheucher, Manfred
    Valtr, Pavel
    Vogtenhuber, Birgit
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2020, 173
  • [7] Separating bichromatic point sets by two disjoint isothetic rectangles
    Moslehi, Z.
    Bagheri, A.
    [J]. SCIENTIA IRANICA, 2016, 23 (03) : 1228 - 1238
  • [8] Partitioning point sets in space into disjoint convex polytopes
    Urabe, M
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1999, 13 (03): : 173 - 178
  • [9] Disjoint empty convex pentagons in planar point sets
    Bhaswar B. Bhattacharya
    Sandip Das
    [J]. Periodica Mathematica Hungarica, 2013, 66 : 73 - 86
  • [10] Disjoint empty convex pentagons in planar point sets
    Bhattacharya, Bhaswar B.
    Das, Sandip
    [J]. PERIODICA MATHEMATICA HUNGARICA, 2013, 66 (01) : 73 - 86