Geometric orderings of intersecting translates and their applications

DOI10.1016/0925-7721(95)00043-7zbMath0869.68107OpenAlexW2034331916MaRDI QIDQ676584

Jean-Marc Robert

Publication date: 18 March 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00043-7

zbMATH Keywords

line transversal

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Hadwiger's transversal theorem to intersecting sets
• Upper bounds on geometric permutations for convex sets
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Covering convex sets with non-overlapping polygons
• Geometric permutations and common transversals
• Geometric permutations of disjoint translates of convex sets
• Stabbing line segments
• The different ways of stabbing disjoint convex sets
• Proof of Grünbaum's conjecture on common transversals for translates
• Geometric permutations for convex sets
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A conjecture of Grünbaum on common transversals.

This page was built for publication: Geometric orderings of intersecting translates and their applications