Geometric permutations and common transversals
From MaRDI portal
Publication:1084672
DOI10.1007/BF02187708zbMath0606.52001OpenAlexW1976350480MaRDI QIDQ1084672
Publication date: 1986
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131003
Related Items (11)
On neighbors in geometric permutations. ⋮ Covering convex sets with non-overlapping polygons ⋮ Algorithms for high dimensional stabbing problems ⋮ The different ways of stabbing disjoint convex sets ⋮ Suballowable sequences and geometric permutations ⋮ Geometric orderings of intersecting translates and their applications ⋮ Geometric permutations for convex sets ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ 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
Cites Work
This page was built for publication: Geometric permutations and common transversals