On disjoint holes in point sets
Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 1049-1056
Manfred Scheucher; Manfred Scheucher. On disjoint holes in point sets. Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 1049-1056. http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a107/
@article{AMUC_2019_88_3_a107,
     author = {Manfred Scheucher and Manfred Scheucher},
     title = { On disjoint holes in point sets},
     journal = {Acta mathematica Universitatis Comenianae},
     pages = {1049--1056},
     year = {2019},
     volume = {88},
     number = {3},
     url = {http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a107/}
}
TY  - JOUR
AU  - Manfred Scheucher
AU  - Manfred Scheucher
TI  - On disjoint holes in point sets
JO  - Acta mathematica Universitatis Comenianae
PY  - 2019
SP  - 1049
EP  - 1056
VL  - 88
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a107/
ID  - AMUC_2019_88_3_a107
ER  - 
%0 Journal Article
%A Manfred Scheucher
%A Manfred Scheucher
%T On disjoint holes in point sets
%J Acta mathematica Universitatis Comenianae
%D 2019
%P 1049-1056
%V 88
%N 3
%U http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a107/
%F AMUC_2019_88_3_a107

Voir la notice de l'article provenant de la source Comenius University

Given a set of points $S \subseteq \mathbb{R}^2$, a subset $X \subseteq S$, $|X|=k$, is called \emph{$k$-gon} if all points of $X$ lie on the boundary of $\mathrm{conv} (X)$, and \emph{$k$-hole} if, in addition, no point of $S \setminus X$ lies in $\mathrm{conv} (X)$. We use computer assistance to show that every set of 17 points in general position admits two \emph{disjoint} 5-holes, that is, holes with disjoint respective convex hulls. This answers a question of Hosono and Urabe (2001). 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).