We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the plane that contain exactly one endpoint of each segment of S. Concretely, we provide efficient algorithms for reporting all combinatorially different stabbing regions for S for regions that can be described as the intersection of axis-parallel halfplanes; these are halfplanes, strips, quadrants, 3-sided rectangles, and rectangles. The running times are O(n) (for the halfplane case), O(n log n) (for ...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the plane that contain exactly one endpoint of each segment of S. Concretely, we provide efficient algorithms for reporting all combinatorially different stabbing regions for S for regions that can be described as the intersection of axis-parallel halfplanes; these are halfplanes, strips, quadrants, 3-sided rectangles, and rectangles. The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).
Citation
Claverol, M., Garijo, D., Korman, M., Seara, C., Silveira, R.I. Stabbing segments with rectilinear objects. A: "Fundamentals of Computation Theory · Volume 9210 of the series Lecture Notes in Computer Science". 2015, p. 53-64.