Cutting a set of disks by a line with leaving many intact disks in both sides
From MaRDI portal
Publication:1976330
DOI10.1006/jcta.1999.3037zbMath0956.52004OpenAlexW2008486955MaRDI QIDQ1976330
Publication date: 4 March 2001
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6796485dae3af7ab71f73a6be579d774894ca59c
Inequalities and extremum problems involving convexity in convex geometry (52A40) Helly-type theorems and geometric transversal theory (52A35)
Related Items (3)
Piercing a set of disjoint balls by a line ⋮ Cutting a bunch of grapes by a plane ⋮ Piercing balls sitting on a table by a vertical line
Cites Work
This page was built for publication: Cutting a set of disks by a line with leaving many intact disks in both sides