Upper bounds on geometric permutations for convex sets
From MaRDI portal
DOI10.1007/BF02187777zbMATH Open0712.52008MaRDI QIDQ748890FDOQ748890
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131104
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric permutations of disjoint translates of convex sets
- Geometric permutations for convex sets
- A seperation property of plane convex sets.
- Partitions ofN-Space by Hyperplanes
- Geometric permutations and common transversals
- A conjecture of Grünbaum on common transversals.
Cited In (18)
- 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\)
- Title not available (Why is that?)
- Geometric permutations of disjoint translates of convex sets
- Geometric permutations of higher dimensional spheres
- Geometric permutations of disjoint unit spheres
- Erased arrangements of linear and convex decompositions of polyhedra
- Geometric permutations for convex sets
- Some Discrete Properties of the Space of Line Transversals to Disjoint Balls
- Inflating balls is NP-hard
- 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.
- Geometric orderings of intersecting translates and their applications
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)\) 👍 👎
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)
