Stabbing segments with rectilinear objects

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 stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(nlogn) (for strips, quadrants, and 3-sided rectangles), and O(n2logn) (for rectangles).

[1]  Asish Mukhopadhyay,et al.  On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area , 2009, Int. J. Comput. Geom. Appl..

[2]  Rolf Klein,et al.  Smallest Color-Spanning Objects , 2001, ESA.

[3]  Sandip Das,et al.  Smallest Color-Spanning Object Revisited , 2009, Int. J. Comput. Geom. Appl..

[4]  David Avis,et al.  Polyhedral line transversals in space , 1988, Discret. Comput. Geom..

[5]  Michael T. Goodrich,et al.  Stabbing Parallel Segments with a Convex Polygon (Extended Abstract) , 1989, WADS.

[6]  Arnold L. Rosenberg,et al.  Stabbing line segments , 1982, BIT.

[7]  Joachim Gudmundsson,et al.  Path Simplification for Metro Map Layout , 2006, Graph Drawing.

[8]  Joseph O'Rourke,et al.  An on-line algorithm for fitting straight lines between data ranges , 1981, CACM.

[9]  Hazel Everett,et al.  Transversals to Line Segments in Three-Dimensional Space , 2005, Discret. Comput. Geom..

[10]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[11]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..

[12]  Marco Pellegrini.  Lower Bounds on Stabbing Lines in 3-space , 1993, Comput. Geom..

[13]  Esther M. Arkin,et al.  Convex transversals , 2014, Comput. Geom..

[14]  Asish Mukhopadhyay,et al.  Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments , 1993, CCCG.

[15]  Stephane Durocher,et al.  On k-Enclosing Objects in a Coloured Point Set , 2013, CCCG.

[16]  Joseph S. B. Mitchell,et al.  Distributed localization and clustering using data correlation and the Occam's razor principle , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

[17]  Mercè Claverol,et al.  Stabbers of line segments in the plane , 2011, Comput. Geom..

[18]  Michael T. Goodrich,et al.  Stabbing Parallel Segments with a Convex Polygon , 1990, Comput. Vis. Graph. Image Process..

[19]  Dan Halperin,et al.  Lines through Segments in 3D Space , 2012, ESA.

[20]  Ivan Stojmenovic,et al.  Computing shortest transversals of sets , 1992, Int. J. Comput. Geom. Appl..

[21]  Matias Korman,et al.  Stabbing segments with rectilinear objects , 2015, FCT.

[22]  Rolf Klein,et al.  The Farthest Color Voronoi Diagram and Related Problems , 2001 .

[23]  Ivan Stojmenovic,et al.  Computing shortest transversals of sets (extended abstract) , 1991, SCG '91.

[24]  Alexander Pilz,et al.  New results on stabbing segments with a polygon , 2015, Comput. Geom..

[25]  David Avis,et al.  Lower Bounds for Line Stabbing , 1989, Inf. Process. Lett..

[26]  Haim Kaplan,et al.  Line Transversals of Convex Polyhedra in R3 , 2009, SIAM J. Comput..

[27]  Jun Luo,et al.  Stabbing balls and simplifying proteins , 2009, Int. J. Bioinform. Res. Appl..

[28]  Esther M. Arkin,et al.  Conflict-free Covering , 2015, CCCG.

[29]  David Rappaport.  Minimum polygon transversals of line segments , 1995, Int. J. Comput. Geom. Appl..

[30]  Mikhail J. Atallah,et al.  Efficient Algorithms for Common Transversals , 1987, Inf. Process. Lett..

[31]  E. Arkin,et al.  The Shortest Separating Cycle Problem , 2016, WAOA.

[32]  R. Pollack,et al.  Geometric Transversal Theory , 1993 .

[33]  Asish Mukhopadhyay,et al.  On intersecting a set of parallel line segments with a convex polygon of minimum area , 2008, Inf. Process. Lett..

[34]  Evanthia Papadopoulou,et al.  Stabbing Circles for Sets of Segments in the Plane , 2016, LATIN.