Optimal conditions for connectedness of discretized sets

08/09/2018
by   Boris Brimkov, et al.
0

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 R^n, and generalize several previous results. Algorithmic aspects and possible applications are briefly discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2021

Deducing properties of ODEs from their discretization

We show that some hard to detect properties of quadratic ODEs (eg certai...
research
03/11/2023

Characterizations of the set of integer points in an integral bisubmodular polyhedron

In this note, we provide two characterizations of the set of integer poi...
research
04/05/2022

On the size distribution of Levenshtein balls with radius one

The fixed length Levenshtein (FLL) distance between two words 𝐱,𝐲∈ℤ_m^n ...
research
08/21/2001

On Classes of Functions for which No Free Lunch Results Hold

In a recent paper it was shown that No Free Lunch results hold for any s...
research
01/29/2023

Random points are good for universal discretization

Recently, there was a big progress in studying sampling discretization o...
research
11/09/2020

Discretization on high-dimensional domains

Let μ be a Borel probability measure on a compact path-connected metric ...
research
04/04/2020

Convergence analysis of pixel-driven Radon and fanbeam transforms

This paper presents a novel mathematical framework for understanding pix...

Please sign up or login with your details

Forgot password? Click here to reset