Work

On exact covering with unit disks

Year: 2025

Type: article

Abstract: We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an exact cover is not possible.

Source: Computational Geometry

DOI: 10.1016/j.comgeo.2025.102193

Authors: Ji Hoon Chun, Christian Kipp, Sandro Roch

Institution: Technische Universität Berlin

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,540

Funder: Deutsche Forschungsgemeinschaft