Geometric orderings of intersecting translates and their applications
From MaRDI portal
(Redirected from Publication:676584)
Recommendations
Cites work
- A conjecture of Grünbaum on common transversals.
- A generalization of Hadwiger's transversal theorem to intersecting sets
- Covering convex sets with non-overlapping polygons
- Geometric permutations and common transversals
- Geometric permutations for convex sets
- Geometric permutations of disjoint translates of convex sets
- scientific article; zbMATH DE number 431990 (Why is no real title available?)
- scientific article; zbMATH DE number 3133224 (Why is no real title available?)
- scientific article; zbMATH DE number 3156887 (Why is no real title available?)
- scientific article; zbMATH DE number 3271295 (Why is no real title available?)
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Proof of Grünbaum's conjecture on common transversals for translates
- Stabbing line segments
- 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
- Upper bounds on geometric permutations for convex sets
Cited in
(2)
This page was built for publication: Geometric orderings of intersecting translates and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676584)