Stabbing pairwise intersecting disks by five points
نویسندگان
چکیده
منابع مشابه
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.
متن کاملStabbing simplices by points and flats
The following result was proved by Bárány in 1982: For every d ≥ 1 there exists cd > 0 such that for every n-point set S in R d there is a point p ∈ R contained in at least cdn d+1 −O(n) of the d-dimensional simplices spanned by S. We investigate the largest possible value of cd. It was known that cd ≤ 1/(2(d+ 1)!) (this estimate actually holds for every point set S). We construct sets showing ...
متن کاملKite-designs intersecting in pairwise disjoint blocks
A kite-design of order n is a decomposition of the complete graph Kn into kites. Such systems exist precisely when n ≡ 0, 1 (mod 8). Two kite systems (X,K1) and (X,K2) are said to intersect in m pairwise disjoint blocks if |K1∩K2| = m and all blocks in K1∩K2 are pairwise disjoint. In this paper we determine all the possible values of m such that there are two kite-designs of order n intersectin...
متن کاملStabbing Line Segments with Disks: Complexity and Approximation Algorithms
Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line drawing of planar graph. This problem along with its relatives [3] arise in physical network security analysis for telecommunication, wireless and road networks represented by geometric graphs ...
متن کاملIdentification of points using disks
We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an instance of the test covering problem with geometric constraints on the tests. We give tight lower and upper bounds on the number of disks needed to identify...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: 0012-365X
DOI: 10.1016/j.disc.2021.112403