Upper bounds on geometric permutations for convex sets

DOI10.1007/BF02187777zbMath0712.52008MaRDI QIDQ748890

Rephael Wenger

Publication date: 1990

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131104

zbMATH Keywords

common transversalsGeometric permutationsseparation sets

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (12)

INFLATING BALLS IS NP-HARD ⋮ Geometric permutations of higher dimensional spheres ⋮ Convex polygons made from few lines and convex decompositions of polyhedra ⋮ Erased arrangements of linear and convex decompositions of polyhedra ⋮ Geometric permutations of balls with bounded size disparity. ⋮ On neighbors in geometric permutations. ⋮ On \(k\)-sets in arrangements of curves and surfaces ⋮ The different ways of stabbing disjoint convex sets ⋮ Geometric orderings of intersecting translates and their applications ⋮ Geometric permutations of disjoint unit spheres ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ Polyhedral line transversals in space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric permutations and common transversals
• Geometric permutations of disjoint translates of convex sets
• Geometric permutations for convex sets
• A seperation property of plane convex sets.
• A conjecture of Grünbaum on common transversals.
• Partitions ofN-Space by Hyperplanes

This page was built for publication: Upper bounds on geometric permutations for convex sets