Cutting disjoint disks by straight lines
From MaRDI portal
Publication:2640143
DOI10.1007/BF02187724zbMath0719.52006MaRDI QIDQ2640143
Noga Alon, Meir Katchalski, William R. Pulleyblank
Publication date: 1989
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131073
52A40: Inequalities and extremum problems involving convexity in convex geometry
52C10: Erd?s problems and related topics of discrete geometry
52A37: Other problems of combinatorial convexity
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
Separating translates in the plane: Combinatorial bounds and an algorithm, Intersecting convex sets by rays, Piercing a set of disjoint balls by a line, Cutting a bunch of grapes by a plane, Balanced line separators of unit disk graphs, Allowable interval sequences and separating convex sets in the plane, Separating collections of points in Euclidean spaces, Separating convex sets in the plane, Separation of convex sets, Piercing balls sitting on a table by a vertical line, The geometry of graphs and some of its algorithmic applications, Illuminating high-dimensional convex sets, Cutting out polygon collections with a saw, SLIDING DISKS IN THE PLANE
Cites Work
