Piercing families of convex sets in the plane that avoid a certain subfamily with lines

preprint2022arXivOpen access

Abstract

We define a C(k)C(k) to be a family of kk sets F1,…,FkF_1,\dots,F_k such that conv(Fi∪Fi+1)∩conv(Fj∪Fj+1)=∅\textrm{conv}(F_i\cup F_{i+1})\cap \textrm{conv}(F_j\cup F_{j+1})=\emptyset when {i,i+1}∩{j,j+1}=∅\{i,i+1\}\cap \{j,j+1\}=\emptyset (indices are taken modulo kk). We show that if F\mathcal{F} is a family of compact, convex sets that does not contain a C(k)C(k), then there are k−2k-2 lines that pierce F\mathcal{F}. Additionally, we give an example of a family of compact, convex sets that contains no C(k)C(k) and cannot be pierced by ⌈k2⌉−1\left\lceil \frac{k}{2} \right\rceil -1 lines.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.