Computing shortest transversals of sets

Given a family of objects in the plane, the line transversal problem is to compute a line that intersects every member of the family. In this paper we examine a variation of the line transversal problem that involves computing a shortest line segment that intersects every member of the family. In particular, we give O(n log n) time algorithms for computing a shortest transversal of a family of n lines, a family of n line segments, and a family of convex polygons with a total of n vertices. In general, finding a line transversal for a family of n objects takes Ω(n log n) time. This time bound holds for a family of n line segments as well as for a family of convex polygons with a total of n vertices. Hence, our shortest transversal algorithms for these families are optimal.

[1]  G. Toussaint,et al.  Finding the minimum vertex distance between two disjoint convex polygons in linear time , 1985 .

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

[3]  Chanderjit Bajaj,et al.  On the duality of intersection and closest points , 1983 .

[4]  Rephael Wenger,et al.  Stabbing pairwise disjoint translates in linear time , 1989, SCG '89.

[5]  Hiroshi Imai,et al.  Weighted Orthogonal Linear L∞-Approximation and Applications , 1989, WADS.

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

[7]  David Avis,et al.  Algorithms for high dimensional stabbing problems , 1990, Discret. Appl. Math..

[8]  M. Keil,et al.  A Simple Algorithm for Determining the Envelope of a Set of Lines , 1991, Inf. Process. Lett..

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

[10]  Leonidas J. Guibas,et al.  The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..

[11]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[12]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[13]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

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

[15]  Herbert Edelsbrunner.  Finding Transversals for Sets of Simple Geometric Figures , 1985, Theor. Comput. Sci..