Elsevier

Computational Geometry

Volume 60, January 2017, Pages 8-18
Computational Geometry

Approximation algorithms for the unit disk cover problem in 2D and 3D

https://doi.org/10.1016/j.comgeo.2016.04.002Get rights and content
Under an Elsevier user license
open archive

Abstract

Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks. This problem is known to be NP-hard. We present a simple 4-approximation algorithm for this problem which runs in O(nlogn)-time. We also show how to extend this algorithm to other metrics, and to three dimensions.

Keywords

Unit disk covering
Unit ball covering
Approximation algorithms

Cited by (0)

1

Research supported by NSERC.