Upper bounds on geometric permutations for convex sets
From MaRDI portal
Publication:748890
DOI10.1007/BF02187777zbMath0712.52008MaRDI QIDQ748890
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131104
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)
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
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, Erased arrangements of linear and convex decompositions of polyhedra