The different ways of stabbing disjoint convex sets

DOI10.1007/BF02187836zbMath0748.52006MaRDI QIDQ1184163

S. Singh

Publication date: 28 June 1992

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

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

zbMATH Keywords

common transversalconvex sets in \(\mathbb{R}^ n\)

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (7)

INFLATING BALLS IS NP-HARD ⋮ Geometric permutations of higher dimensional spheres ⋮ Geometric permutations of balls with bounded size disparity. ⋮ On neighbors in geometric permutations. ⋮ 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

Cites Work

• Unnamed Item
• Upper bounds on geometric permutations for convex sets
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• On common transversals
• Geometric permutations and common transversals
• Geometric permutations of disjoint translates of convex sets
• Proof of Grünbaum's conjecture on common transversals for translates
• Geometric permutations for convex sets
• A conjecture of Grünbaum on common transversals.

This page was built for publication: The different ways of stabbing disjoint convex sets