Polyhedral line transversals in space

DOI10.1007/BF02187911zbMath0679.68130MaRDI QIDQ1822999

Raphael Wenger, David Avis

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131049

zbMATH Keywords

Algorithmsline transversals

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35) Discrete mathematics in relation to computer science (68R99)

Related Items

Lower bounds on stabbing lines in 3-space ⋮ Improved bound for the Gerver-Ramsey collinearity problem ⋮ Algorithms for high dimensional stabbing problems ⋮ Bisections and ham-sandwich cuts of convex polygons and polyhedra ⋮ Stabbing segments with rectilinear objects ⋮ Finding stabbing lines in 3-space ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ Computing shortest transversals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Fast detection of polyhedral intersection
• Diameter partitioning
• Finding transversals for sets of simple geometric figures
• Thin sets and common transversals
• Stabbing line segments
• Geometric permutations for convex sets
• Hadwiger's Transversal Theorem In Higher Dimensions