The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)

DOI10.1007/S00454-005-1219-6zbMath1093.52004OpenAlexW2125507514MaRDI QIDQ2492643

Meir Katchalski, Andrei Asinowski

Publication date: 14 June 2006

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

Full work available at URL: https://doi.org/10.1007/s00454-005-1219-6

zbMATH Keywords

transversalgeometric permutationsHelly-type problems

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Convex sets in (3) dimensions (including convex surfaces) (52A15) Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (2)

INFLATING BALLS IS NP-HARD ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls

This page was built for publication: The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)