The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
From MaRDI portal
Publication:748891
DOI10.1007/BF02187778zbMath0712.52009MaRDI QIDQ748891
Herbert Edelsbrunner, Micha Sharir
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131105
52A40: Inequalities and extremum problems involving convexity in convex geometry
52A37: Other problems of combinatorial convexity
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
Geometric orderings of intersecting translates and their applications, On \(k\)-sets in arrangements of curves and surfaces, The different ways of stabbing disjoint convex sets, The overlay of lower envelopes and its applications, Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind