Upper bounds for the piercing number of families of pairwise intersecting convex polygons

MaRDI QIDQ6230005zbMATH OpenFDO

Authors Meir Katchalski, D. Nashtir

Publication date 31 December 2011

Abstract: A convex polygon $A$ is related to a convex $m$-gon $$, where $k_1^{+},\mathrm{...},k_m^{+}$ are the $m$ halfplanes whose intersection is equal to $K$, if $A$ is the intersection of halfplanes $a_1^{+},\mathrm{...},a_l$, each of which is a translate of one of the $k_i^{+}$-s. The planar family $calA$ is related to $K$ if each $AincalA$ is related to $K$. We prove that any family of pairwise intersecting convex sets related to a given $n$-gon has a finite piercing number which depends on $n$. In the general case we show $O(3^{n^3})$, while for a certain class of families, we decrease the bound to $4(n-2)$, and for $n=3,4$ the bound is 3 and 6 respectively.

This page was built for publication: Upper bounds for the piercing number of families of pairwise intersecting convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6230005)