Unit Disk Cover for Massive Point Sets

Download PDF
Open Webpage

Anirban Ghosh, Brian Hicks, Ronald Shevchenko

Published: 01 Jan 2019, Last Modified: 13 May 2025SEA² 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Given a set of points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-Hard and several approximation algorithms have been designed over the last three decades.