This paper studies algorithmic Helly-type problems in the framework of the algorithmic theory of convex bodies developed by Grötschel, Lovász, and Schrijver. Various
oracle-polynomial-time algorithms are presented that are complemented by NP-hardness results for polytopes. In addition, some new Helly-type theorems are derived.
Zeitschriftentitel:
Discrete & Computational Geometry
Jahr:
1997
Heft / Issue:
17
Seitenangaben Beitrag:
393-410
Reviewed:
ja
Sprache:
en
TUM Einrichtung:
Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik