Stabbers of line segments in the plane (Q543793)

This paper is focused on the problem of computing a representation of the stabbers of a not necessarily disjoint line segments in the plane. The authors consider this problem to be a separability problem and design efficient algorithms for computing stabbers for a set of line segments in the plane satisfying the so called separability condition, i.e. the condition that there is no segment stabbed by more than one element of the stabber. The problems of finding the stabbing line (the line which intersects each segment of the set; the line passing through the endpoints of the segment and the line containing the segment including), the stabbing wedge (two rays with a common endpoint), the stabbing double wedge (two intersecting lines) and the zigzag stabber (formed by two non-intersecting rays and a segment joining the origins of the rays) are investigated and solved.