English

Two Disjoint 5-Holes in Point Sets

Combinatorics 2020-05-21 v4 Computational Geometry

Abstract

Given a set of points SR2S \subseteq \mathbb{R}^2, a subset XSX \subseteq S with X=k|X|=k is called kk-gon if all points of XX lie on the boundary of the convex hull of XX, and kk-hole if, in addition, no point of SXS \setminus X lies in the convex hull of XX. 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 Mari\'c (2019).

Keywords

Cite

@article{arxiv.1807.10848,
  title  = {Two Disjoint 5-Holes in Point Sets},
  author = {Manfred Scheucher},
  journal= {arXiv preprint arXiv:1807.10848},
  year   = {2020}
}
R2 v1 2026-06-23T03:17:39.774Z