On connectedness of discretized sets

From MaRDI portal



Abstract: Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set X is obtained by taking the integer points inside a closed neighborhood of X of a certain radius. In this note we determine a minimum threshold for the offset radius, beyond which the discretization of a disconnected set is always connected. The results hold for a broad class of disconnected and unbounded subsets of Rn, and generalize several previous results. Algorithmic aspects and possible applications are briefly discussed.


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].











This page was built for publication: On connectedness of discretized sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037368)