Algorithms for Geometric Covering Problems

Abstract

Motivated by the applications in facility location, VLSI design, image processing and motion planning, geometric covering problems have been studied extensively in the literature. In this thesis various geometric covering problems such as covering points with disks, and squares, covering rectangular regions and convex polygonal regions with disks are considered. The problems are investigated by proposing approximation, parameterized and heuristic algorithms. The Discrete Unit Disk Cover (DUDC) problem is one of the well known geometric covering problems. The DUDC problem is a NP-complete problem.