加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本