On connectedness of discretized sets (Q2037368)

In many areas of mathematics and its applications, a discretization of a set \(X\subseteq \mathbb{R}^n\) is desirable. A frequently used, natural and simple type of discretization of a set \(X\) is the one defined by the integer points within a closed neighborhood of \(X\) of radius \(r\). This radius \(r\) is called the offset radius. The paper under review determines the minimum threshold for the offset radius, beyond which the discretization of an arbitrary (possibly disconnected) set is always connected. For the entire collection see [Zbl 1464.68015].