DeepAI AI Chat
Log In Sign Up

Geometric Multicut

by   Mikkel Abrahamsen, et al.
City, University of London
Freie Universität Berlin
Københavns Uni
Utrecht University

We study the following separation problem: Given a collection of colored objects in the plane, compute a shortest "fence" F, i.e., a union of curves of minimum total length, that separates every two objects of different colors. 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, where k is the number of different colors, as it can be seen as a geometric analogue to the well-studied multicut problem on graphs. We first give an O(n^4^3 n)-time algorithm that computes an optimal fence for the case where the input consists of polygons of two colors and n corners in total. We then show that the problem is NP-hard for the case of three colors. Finally, we give a (2-4/3k)-approximation algorithm.


page 2

page 4

page 8

page 10

page 12

page 13

page 14

page 16


Minimum Link Fencing

We study a variant of the geometric multicut problem, where we are given...

Fast Fencing

We consider very natural "fence enclosure" problems studied by Capoyleas...

A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree 3 Tree

A rooted tree R⃗ is a rooted subtree of a tree T if the tree obtained by...

Maximum Bipartite Subgraph of Geometric Intersection Graphs

We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...

Zero-phase angle asteroid taxonomy classification using unsupervised machine learning algorithms

We are in an era of large catalogs and, thus, statistical analysis tools...

From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy

Let γ be a generic closed curve in the plane. Samuel Blank, in his 1967 ...