Two Disjoint 5-Holes in Point Sets
Abstract
Given a set of points , a subset with is called -gon if all points of lie on the boundary of the convex hull of , and -hole if, in addition, no point of lies in the convex hull of . 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).
Cite
@article{arxiv.1807.10848,
title = {Two Disjoint 5-Holes in Point Sets},
author = {Manfred Scheucher},
journal= {arXiv preprint arXiv:1807.10848},
year = {2020}
}