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
Inequalities and extremum problems involving convexity in convex geometry (52A40) Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Separation of convex sets, Separating translates in the plane: Combinatorial bounds and an algorithm, The geometry of graphs and some of its algorithmic applications, Illuminating high-dimensional convex sets, Allowable interval sequences and separating convex sets in the plane, Separating convex sets in the plane, Intersecting convex sets by rays, Separating collections of points in Euclidean spaces, Piercing a set of disjoint balls by a line, Cutting a bunch of grapes by a plane, SLIDING DISKS IN THE PLANE, Balanced line separators of unit disk graphs, Piercing balls sitting on a table by a vertical line, Cutting out polygon collections with a saw
Cites Work
