Pairwise intersecting homothets of a convex body

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coloring translates and homothets of a convex body

We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in R.

متن کامل

Measure of Planes Intersecting a Convex Body

Recall that an element de of the standard measure is written as de = dp · dξ, where (p, ξ) is the usual parametrization of a plane e: p is the distance of e from the origin O; ξ ∈ S is the direction normal to e, dξ is an element of solid angle of the unit sphere S. Where appropriate we write h(e) = h(p, ξ). The concept of a flag in R which naturally emerges in Combinatorial integral geometry wi...

متن کامل

On the transversal number and VC-dimension of families of positive homothets of a convex body

Let F be a family of positive homothets (or translates) of a given convex body K in Rn. We investigate two approaches to measuring the complexity of F . First, we find an upper bound on the transversal number τ(F) of F in terms of n and the independence number ν(F). This question is motivated by a problem of Grünbaum [2]. Our bound τ(F) ≤ 2n (2n n ) (n logn+ log logn+ 5n)ν(F) is exponential in ...

متن کامل

Helly-type Theorems for Homothets of Planar Convex Curves

Helly’s theorem implies that if S is a finite collection of (positive) homothets of a planar convex body B, any three having non-empty intersection, then S has non-empty intersection. We show that for collections S of homothets (including translates) of the boundary ∂B, if any four curves in S have non-empty intersection, then S has non-empty intersection. We prove the following dual version: I...

متن کامل

Stabbing pairwise intersecting disks by five points

We present a deterministic linear time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three points.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2017

ISSN: 1571-0653

DOI: 10.1016/j.endm.2017.07.065