Ordered stabbing of pairwise disjoint convex sets in linear time
From MaRDI portal
Publication:1175783
DOI10.1016/0166-218X(91)90065-5zbMath0772.68100MaRDI QIDQ1175783
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- A generalization of Hadwiger's transversal theorem to intersecting sets
- Algorithms for high dimensional stabbing problems
- Finding transversals for sets of simple geometric figures
- Geometric permutations of disjoint translates of convex sets
- Two counterexamples concerning transversals for convex subsets of the plane
- Stabbing line segments
- Proof of Grünbaum's conjecture on common transversals for translates
- A conjecture of Grünbaum on common transversals.
This page was built for publication: Ordered stabbing of pairwise disjoint convex sets in linear time