Helly-type theorems and generalized linear programming
From MaRDI portal
Publication:1338955
DOI10.1007/BF02574379zbMath0819.90056MaRDI QIDQ1338955
Publication date: 27 November 1994
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131330
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Helly-type theorems for homothets of planar convex curves ⋮ Random sampling in computational algebra: Helly numbers and violator spaces ⋮ On the planar piecewise quadratic 1-center problem ⋮ On geometric optimization with few violated constraints ⋮ Average case analysis of dynamic geometric optimization ⋮ A subexponential bound for linear programming ⋮ Approximation of convex figures by pairs of rectangles ⋮ Removing degeneracy may require unbounded dimension increase ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ No dimension-independent core-sets for containment under homothetics ⋮ Bounding Helly Numbers via Betti Numbers ⋮ Random sampling with removal ⋮ Helly’s theorem: New variations and applications ⋮ Helly numbers of acyclic families ⋮ Discrete and lexicographic Helly-type theorems ⋮ Helly-type theorems for approximate covering ⋮ Violator spaces: Structure and algorithms ⋮ A quantitative Doignon-Bell-Scarf theorem ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Helly-type problems ⋮ An Output-Sensitive Convex Hull Algorithm for Planar Objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Systems of linear interval equations
- Algorithms for high dimensional stabbing problems
- Proof of Grünbaum's conjecture on common transversals for translates
- On the ball spanned by balls
- Checking robust nonsingularity is NP-hard
- A subexponential bound for linear programming
- On Components in Some Families of Sets
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- The Componentwise Distance to the Nearest Singular Matrix
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
- A combinatorial bound for linear programming and related problems
This page was built for publication: Helly-type theorems and generalized linear programming
