An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines

The problem of determining the existence of a simplex which covers a given convex polytope inside another given convex polytope in two-dimensional Euclidean space is shown to be efficiently solvable, and an effective procedure is derived to find a suitable covering simplex or show that none exists....

Ausführliche Beschreibung