Minimum Link Fencing

09/29/2022
∙
by   Sujoy Bhore, et al.
∙
0
∙

We study a variant of the geometric multicut problem, where we are given a set 𝒫 of colored and pairwise interior-disjoint polygons in the plane. The objective is to compute a set of simple closed polygon boundaries (fences) that separate the polygons in such a way that any two polygons that are enclosed by the same fence have the same color, and the total number of links of all fences is minimized. We call this the minimum link fencing (MLF) problem and consider the natural case of bounded minimum link fencing (BMLF), where 𝒫 contains a polygon Q that is unbounded in all directions and can be seen as an outer polygon. We show that BMLF is NP-hard in general and that it is XP-time solvable when each fence contains at most two polygons and the number of segments per fence is the parameter. Finally, we present an O(n log n)-time algorithm for the case that the convex hull of 𝒫∖{Q} does not intersect Q.

READ FULL TEXT

page 2

page 3

page 5

page 30

page 31

page 32

page 33

research
∙ 08/16/2022

Computing Smallest Convex Intersecting Polygons

A polygon C is an intersecting polygon for a set O of objects in the pla...
research
∙ 02/11/2019

Geometric Multicut

We study the following separation problem: Given a collection of colored...
research
∙ 12/02/2020

A natural extension to the convex hull problem and a novel solution

We study a natural extension to the well-known convex hull problem by in...
research
∙ 05/28/2020

Exact Method for Generating Strategy-Solvable Sudoku Clues

A Sudoku puzzle often has a regular pattern in the arrangement of initia...
research
∙ 02/14/2023

Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

Let E={e_1,…,e_n} be a set of C-oriented disjoint segments in the plane,...
research
∙ 07/02/2019

On the VC-dimension of convex sets and half-spaces

A family S of convex sets in the plane defines a hypergraph H = (S,E) as...
research
∙ 05/09/2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time

Given a threshold L and a set R = {R_1, ..., R_m} of m haplotype sequenc...

Please sign up or login with your details

Forgot password? Click here to reset