Stabbing horizontal segments with vertical rays

We consider maintaining a dynamic set S of N horizontal segments in ℝ² such that, given a vertical ray Q in ℝ², the segments in S intersecting Q can be reported efficiently. In the external memory model, we give a structure that consumes O(N/B) space, ...

Given a set S of n line segments in the plane, we say that a region RR2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different ...

An algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane is presented. As a matter of fact, the algorithm computes a description of all stabbing lines. A ...