On connectedness of discretized sets
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].
- Connectedness of offset digitizations in higher dimensions
- Correspondence between topological and discrete connectivities in Hausdorff discretization
- Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD
- Topological properties of Hausdorff discretizations
- scientific article; zbMATH DE number 2079719
- Correspondence between topological and discrete connectivities in Hausdorff discretization
- Optimal conditions for connectedness of discretized sets
- Connectedness of offset digitizations in higher dimensions
- scientific article; zbMATH DE number 6831870 (Why is no real title available?)
- Total disconnectedness of the quotient Aubry set in low dimensions
- A Note on Discrete Connections on Regular Lattice
- On connectivity of discretized 2D explicit curve
- On discreteness of commensurators
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)