Upper bounds on geometric permutations for convex sets

DOI10.1007/BF02187777MaRDI QIDQ748890zbMATH OpenFDO

Authors 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

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

Recommendations

• Geometric permutations and common transversals
• Geometric permutations for convex sets
• The different ways of stabbing disjoint convex sets
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A conjecture of Grünbaum on common transversals.
• A seperation property of plane convex sets.
• Geometric permutations and common transversals
• Geometric permutations for convex sets
• Geometric permutations of disjoint translates of convex sets
• Partitions ofN-Space by Hyperplanes

Cited in

(24)

• Geometric permutations and common transversals
• scientific article; zbMATH DE number 2209714 (Why is no real title available?)
• The different ways of stabbing disjoint convex sets
• Geometric permutations of balls with bounded size disparity.
• A constant bound for geometric permutations of disjoint unit balls
• On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane
• A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)
• The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)
• Geometric permutations of disjoint translates of convex sets
• scientific article; zbMATH DE number 7053339 (Why is no real title available?)
• Geometric permutations of higher dimensional spheres
• Geometric permutations of disjoint unit spheres
• Bounding the number of geometric permutations induced by \(k\)-transversals
• Erased arrangements of linear and convex decompositions of polyhedra
• Geometric permutations for convex sets
• Inflating balls is NP-hard
• Improved bounds for geometric permutations
• scientific article; zbMATH DE number 2089216 (Why is no real title available?)
• On \(k\)-sets in arrangements of curves and surfaces
• Polyhedral line transversals in space
• Convex polygons made from few lines and convex decompositions of polyhedra
• On neighbors in geometric permutations.
• Some discrete properties of the space of line transversals to disjoint balls
• Geometric orderings of intersecting translates and their applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q748890)