A short proof of an interesting Helly-type theorem

DOI10.1007/BF02711517zbMath0851.52007OpenAlexW2074581052MaRDI QIDQ1913693

Nina Amenta

Publication date: 27 May 1996

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

Full work available at URL: https://doi.org/10.1007/bf02711517

zbMATH Keywords

linear programmingHelly-type theorem

Mathematics Subject Classification ID

Linear programming (90C05) Helly-type theorems and geometric transversal theory (52A35)

Related Items (8)

Bounding Helly Numbers via Betti Numbers ⋮ Leray numbers of projections and a topological Helly-type theorem ⋮ Helly’s theorem: New variations and applications ⋮ Helly numbers of acyclic families ⋮ Violator spaces: Structure and algorithms ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ Dimension gaps between representability and collapsibility ⋮ Contraction and expansion of convex sets

Cites Work

• On Components in Some Families of Sets
• Las Vegas algorithms for linear and integer programming when the dimension is small
• A combinatorial bound for linear programming and related problems
• Helly type properties of unions of convex sets
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of an interesting Helly-type theorem