Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Identification of points using disks

Valentin Gledel 1 Aline Parreau 1 
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an instance of the test covering problem with geometric constraints on the tests. We give tight lower and upper bounds on the number of disks needed to identify any set of n points of the plane. In particular, we prove that if there are no three colinear points nor four cocyclic points, then roughly n/3 disks are enough, improving the known bound of (n+1)/2 when we only require that no three points are colinear. We also consider complexity issues when the radius of the disks is fixed, proving that this problem is NP-complete. In contrast, we give a linear-time algorithm computing the exact number of disks if the points are colinear.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Valentin Gledel Connect in order to contact the contributor
Submitted on : Thursday, June 1, 2017 - 11:27:21 AM
Last modification on : Monday, March 21, 2022 - 11:22:02 AM
Long-term archiving on: : Wednesday, September 6, 2017 - 6:44:55 PM


Files produced by the author(s)



Valentin Gledel, Aline Parreau. Identification of points using disks. Discrete Mathematics, Elsevier, 2019, 342 (1), pp.256-269. ⟨10.1016/j.disc.2018.10.002⟩. ⟨hal-01531101⟩



Record views


Files downloads