# 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 follows. Every subfamily S'⊂ S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S', and no other set of S is fully contained in h. In this case, we say that h realizes S'. We say a set S is shattered, if all its subsets are realized. The VC-dimension of a hypergraph H is the size of the largest shattered set. We show that the VC-dimension for pairwise disjoint convex sets in the plane is bounded by 3, and this is tight. In contrast, we show the VC-dimension of convex sets in the plane (not necessarily disjoint) is unbounded. We also show that the VC-dimension is unbounded for pairwise disjoint convex sets in R^d, for d≥ 3. We focus on, possibly intersecting, segments in the plane and determine that the VC-dimension is always at most 5. And this is tight, as we construct a set of five segments that can be shattered. We give two exemplary applications. One for a geometric set cover problem and one for a range-query data structure problem, to motivate our findings.

• 8 publications
• 1 publication
• 26 publications
• 6 publications
research
09/06/2021

### Disjoint axis-parallel segments without a circumscribing polygon

We construct a family of 17 disjoint axis-parallel line segments in the ...
research
08/16/2022

### Computing Smallest Convex Intersecting Polygons

A polygon C is an intersecting polygon for a set O of objects in the pla...
research
06/25/2017

### Compatible 4-Holes in Point Sets

Counting interior-disjoint empty convex polygons in a point set is a typ...
research
09/29/2022

We study a variant of the geometric multicut problem, where we are given...
research
03/07/2019

### An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting

We study the problem of deciding if a given triple of permutations can b...
research
07/27/2018

### 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 p...
research
11/06/2018

### The Set-Maxima Problem in a Geometric Setting

In this paper we look at the classical set-maxima problem. We give a new...