On connectedness of discretized sets (Q2037368): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q169304 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: László A. Székely / rank | |||
Normal rank |
Revision as of 03:39, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On connectedness of discretized sets |
scientific article |
Statements
On connectedness of discretized sets (English)
0 references
1 July 2021
0 references
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].
0 references
discrete geometry
0 references
geometrical features and analysis
0 references
connected set
0 references
discrete connectivity
0 references
connectivity control
0 references
offset discretization
0 references