Efficient covering of convex domains by congruent discs

08/02/2021
by   Shai Gul, et al.
0

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and perimeter of the region. We provide algorithms for efficient covering of convex polygonal regions using unit discs. We show that the computational complexity of the algorithms is pseudo-polynomial in the size of the input and the output. We also show that these algorithms provide a constant factor approximation of the optimal covering of the region.

READ FULL TEXT
research
07/22/2020

Approximate Covering with Lower and Upper Bounds via LP Rounding

In this paper, we study the lower- and upper-bounded covering (LUC) prob...
research
05/03/2023

Online Geometric Covering and Piercing

We consider the online version of the piercing set problem, where geomet...
research
11/04/2022

Smallest covering regions and highest density regions for discrete distributions

This paper examines the problem of computing a canonical smallest coveri...
research
10/08/2021

Polygon Area Decomposition Using a Compactness Metric

In this paper, we consider the problem of partitioning a polygon into a ...
research
04/27/2023

The Covering Canadian Traveller Problem Revisited

In this paper, we consider the k-Covering Canadian Traveller Problem (k-...
research
03/18/2020

Worst-Case Optimal Covering of Rectangles by Disks

We provide the solution for a fundamental problem of geometric optimizat...
research
11/02/2022

An Asymptotically Optimal Bound for Covering Arrays of Higher Index

A covering array is an N × k array (N rows, k columns) with each entry f...

Please sign up or login with your details

Forgot password? Click here to reset