Minimum Cell Connection in Line Segment Arrangements

We study the complexity of the following cell connection problems in segment arrangements. Given a set of straight-line segments in the plane and two points a and b in different cells of the induced arrangement: [(i)] compute the minimum number of segments one needs to remove so that there is a path connecting a to b that does not intersect any of the remaining segments; [(ii)] compute the minimum number of segments one needs to remove so that the arrangement induced by the remaining segments has a single cell. We show that problems (i) and (ii) are NP-hard and discuss some special, tractable cases. Most notably, we provide a near-linear-time algorithm for a variant of problem (i) where the path connecting a to b must stay inside a given polygon P with a constant number of holes, the segments are contained in P, and the endpoints of the segments are on the boundary of P. The approach for this latter result uses homotopy of paths to group the segments into clusters with the property that either all segments in a cluster or none participate in an optimal solution.

[1]  David G. Kirkpatrick,et al.  On Barrier Resilience of Sensor Networks , 2011, ALGOSENSORS.

[2]  Gerhard J. Woeginger,et al.  Paths and cycles in colored graphs , 2001, Australas. J Comb..

[3]  David M. Mount,et al.  The Number of Shortest Paths on the Surface of a Polyhedron , 1990, SIAM J. Comput..

[4]  Mark de Berg,et al.  On lazy randomized incremental construction , 1994, STOC '94.

[5]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[6]  Refael Hassin,et al.  Approximation algorithms and hardness results for labeled connectivity problems , 2006, J. Comb. Optim..

[7]  Seth Hutchinson,et al.  Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[8]  Leonidas J. Guibas,et al.  On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.

[9]  Michael R. Fellows,et al.  The parameterized complexity of some minimum label problems , 2009, J. Comput. Syst. Sci..

[10]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2007, J. Comput. Syst. Sci..

[11]  Ilan Newman,et al.  On grid intersection graphs , 1991, Discret. Math..

[12]  Sergey Bereg,et al.  Approximating Barrier Resilience in Wireless Sensor Networks , 2009, ALGOSENSORS.

[13]  Sadish Sadasivam,et al.  On Representation of Planar Graphs by Segments , 2008, AAIM.

[14]  Maarten Löffler,et al.  On the Complexity of Barrier Resilience for Fat Regions , 2013, ALGOSENSORS.

[15]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[16]  Leonidas J. Guibas,et al.  Ray shooting in polygons using geodesic triangulations , 1991, Algorithmica.

[17]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[18]  Jack Snoeyink,et al.  Testing Homotopy for Paths in the Plane , 2002, SCG '02.

[19]  David G. Kirkpatrick,et al.  A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors , 2014, Int. J. Comput. Geom. Appl..

[20]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.