Algorithms for Covering a Point Set with Two Wedges
Seong-Gwon Kim, Sun-Seok Kim, Chan-Su Sin, Sang Soo Yeo · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2001
In this paper we investigate the problem of covering a set S of n points in the plane with two equi-angular (infinite) wedges. In other words, we want to find two wedges Wl and W2 of minimum angle such that S⊂W1UW2. Apexes of wedges should be at points of S. Depending on howthe wedges are placed we have several cases of the problem and for each of them an efficient algorithm is given