Covering Polygons by Min-Area Convex Polygons

12/07/2019
by   Elias Dahlhaus, et al.
0

Given a set of disjoint simple polygons σ_1, ..., σ_n, of total complexity N, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by their common convex hull. This process continues until no pair of polygons intersect. We show that this process has a unique output, which is a cover of the input polygons by a set of disjoint convex polygons, of total minimum area. Furthermore, we present a near linear time algorithm for computing this partition. The more general problem of covering a set of N segments (not necessarily disjoint) by min-area disjoint polygons can also be solved in near linear time.

READ FULL TEXT
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
03/15/2019

Smallest k-Enclosing Rectangle Revisited

Given a set of n points in the plane, and a parameter k, we consider the...
research
03/12/2023

New Approximation Algorithms for Touring Regions

We analyze the touring regions problem: find a (1+ϵ)-approximate Euclide...
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
06/03/2019

On Romeo and Juliet Problems: Minimizing Distance-to-Sight

We introduce a variant of the watchman route problem, which we call the ...

Please sign up or login with your details

Forgot password? Click here to reset