10 citations · 18 across the 6 of their papers we have counts for
1 paper · 1 filter
Paul Liu, Daniel Lu
Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximatio…