| y (2007) | |||||||||||||||
Abstract | |||||||||||||||
| In this paper we study the separability of two disjoint object sets in the plane by two criteria: we want to know if there is a wedge or a strip separating the object sets. In the affirmative case, we give algorithms for computing all the separating wedges and strips, the wedges with the maximum and minimum angle and the narrowest and the widest strip. The objects we consider are points, segments, polygons and circles. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||