Separability by two lines and by nearly straight polygonal chains Original Research Article

In this paper, we study the separability in the plane by two criteria: double-wedge separability and image-separability. We give an image-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an image-time algorithm for computing a nearly straight minimal image-polygonal chain separating two sets of points, where image is a value which depends on the position of the points.