Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane

We study the following separation problem: Given a collection of pairwise disjoint coloured objects in the plane with k different colours, compute a shortest “fence” F, i.e., a union of curves of minimum total length, that separates every pair of objects of different colours. Two objects are separated if F contains a simple closed curve that has one object in the interior and the other in the exterior. We refer to the problem as geometric k-cut, as it is a geometric analog to the well-studied multicut problem on graphs. We first give an $$O(n^4\log ^3\!n)$$ -time algorithm that computes an optimal fence for the case where the input consists of polygons of two colours with n corners in total. We then show that the problem is NP-hard for the case of three colours. Finally, we give a randomised $$4/3\cdot 1.2965$$ -approximation algorithm for polygons and any number of colours.

[1]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[2]  Pawel Gawrychowski,et al.  Improved Bounds for Shortest Paths in Dense Distance Graphs , 2018, ICALP.

[3]  Neeraj Kayal,et al.  On the Sum of Square Roots of Polynomials and Related Problems , 2011, Computational Complexity Conference.

[4]  Peter Eades,et al.  The complexity of computing minimum separating polygons , 1993, Pattern Recognit. Lett..

[5]  Philip N. Klein,et al.  Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time , 2011, FOCS.

[6]  Ronald L. Graham,et al.  A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES , 1985 .

[7]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[8]  Roy Schwartz,et al.  Simplex Transformations and the Multiway Cut Problem , 2017, SODA.

[9]  Yuval Rabani,et al.  An improved approximation algorithm for multiway cut , 1998, STOC '98.

[10]  Jan Vondrák,et al.  Multiway cut, pairwise realizable distributions, and descending thresholds , 2014, STOC.

[11]  Mikkel Thorup,et al.  Fast fencing , 2018, STOC.

[12]  Prasad Raghavendra,et al.  Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling , 2008, STOC.

[13]  Maarten Löffler,et al.  Geometric Multicut , 2019, ICALP.

[14]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[15]  Karthekeyan Chandrasekaran,et al.  Improving the Integrality Gap for Multiway Cut , 2019, IPCO.

[16]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[17]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.