On Helly's theorem: Algorithms and extensions

DOI10.1007/PL00009300zbMath0884.52010MaRDI QIDQ1356077

Andreas Brieden, Peter Gritzmann

Publication date: 1 April 1998

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

zbMATH Keywords

tractability\({\mathcal H}\)-polytope\({\mathcal K}\)-polytopeoracle-polynomial-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Helly-type theorems and geometric transversal theory (52A35)

Related Items

Deterministic and randomized polynomial‐time approximation of radii