Abstract
A convex polygon is related to a convex -gon , where are the halfplanes whose intersection is equal to , if is the intersection of halfplanes , each of which is a translate of one of the -s. The planar family is related to if each is related to . We prove that any family of pairwise intersecting convex sets related to a given -gon has a finite piercing number which depends on . In the general case we show , while for a certain class of families, we decrease the bound to , and for the bound is 3 and 6 respectively.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.