We construct a family of n disjoint convex set in ℝd having (n/(d-1))d-1 geometric permutations. As well, we complete the enumeration problem for geometric permutations of families of disjoint translates of a convex set in the plane, settle the case for cubes in ℝd, and construct a family of d+1 translates in ℝd admitting (d+1)!/2 geometric permutations. © 1992 Springer-Verlag New York Inc.
CITATION STYLE
Katchalski, M., Lewis, T., & Liu, A. (1992). The different ways of stabbing disjoint convex sets. Discrete & Computational Geometry, 7(1), 197–206. https://doi.org/10.1007/BF02187836
Mendeley helps you to discover research relevant for your work.