Shrinking the Jung radius: Maximizing partial coverage of finite point sets
Combinatorics
2025-12-03 v2 Metric Geometry
Abstract
Jung's theorem says that planar sets of diameter can be covered by a closed circular disk of radius . In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let be the family of all finite sets of points in the plane, of diameter at most . Let the function value () be the largest integer so that for every point set there is a closed circular disk of radius which covers at least points of . We focus on the radii and and prove exact maximum values. Concerning the radius , we prove . Concerning the radius , we prove that if is not a multiple of 7, and is or otherwise. We also initiate further study of the function by giving lower and upper bounds for ().
Cite
@article{arxiv.2407.03553,
title = {Shrinking the Jung radius: Maximizing partial coverage of finite point sets},
author = {András Bezdek and Owen Henderschedt},
journal= {arXiv preprint arXiv:2407.03553},
year = {2025}
}