# On Disjoint Holes in Point Sets

A k-hole in a point set S ⊆R^2 is a subset X ⊆ S, |X|=k, such that all points of X lie on the boundary of the convex hull conv (X) and no point of S ∖ X lies in conv (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 from 2001. Moreover, we provide new bounds for three and more pairwise disjoint holes.

research
06/25/2017

### Compatible 4-Holes in Point Sets

Counting interior-disjoint empty convex polygons in a point set is a typ...
research
06/12/2023

### Three Edge-disjoint Plane Spanning Paths in a Point Set

We study the following problem: Given a set S of n points in the plane, ...
research
11/17/2022

### Crossing and intersecting families of geometric graphs on point sets

Let S be a set of n points in the plane in general position. Two line se...
research
08/11/2019

### Linking of three triangles in 3-space

Two triples of pairwise disjoint triangles in 3-space are combinatoriall...
research
11/03/2017

### PS-DBSCAN: An Efficient Parallel DBSCAN Algorithm Based on Platform Of AI (PAI)

We present PS-DBSCAN, a communication efficient parallel DBSCAN algorith...
research
01/29/2019

### Geometric Interpretation of side-sharing and point-sharing solutions in the P3P Problem

It is well known that the P3P problem could have 1, 2, 3 and at most 4 p...
research
07/02/2019

### On the VC-dimension of convex sets and half-spaces

A family S of convex sets in the plane defines a hypergraph H = (S,E) as...