Related papers: The directed Hausdorff distance between imprecise …
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…
In this paper, the fuzzy Hausdorff distance is studied, and also the fuzzy equidistant set for two points of a fuzzy metric space is introduced. Here, the fuzzy metric space has been redefined using recently developed fuzzy geometry, and…
We calculate the Gromov-Hausdorff distance between vertex sets of regular polygons endowed with the round metric. We give a full answer for the case of n- and m-gons with m divisible by n. Also, we calculate all distances to 2-gons and…
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or…
Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…
In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…
Let $\theta$ be an irrational number and $\varphi: {\mathbb N} \to {\mathbb R}^{+}$ be a monotone decreasing function tending to zero. Let $$E_\varphi(\theta) =\Big\{y \in \mathbb R: \|n\theta- y\|<\varphi(n), \ {\text{for infinitely…
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…
In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
In practical purposes for some geometrical problems in computer science we have as information the coordinates of some finite points in surface instead of the whole body of a surface. The problem arised here is: "How to define a distance…
We prove that if $A$ is a Borel set in the plane of equal Hausdorff and packing dimension $s>1$, then the set of pinned distances $\{ |x-y|:y\in A\}$ has full Hausdorff dimension for all $x$ outside of a set of Hausdorff dimension $1$ (in…
Given a weight vector $\tau=(\tau_{1}, \dots, \tau_{n}) \in \mathbb{R}^{n}_{+}$ with each $\tau_{i}$ bounded by certain constraints, we obtain a lower bound for the Hausdorff dimension of the set of $\tau$-approximable points points over a…
The measure of distance between two fuzzy sets is a fundamental tool within fuzzy set theory. However, current distance measures within the literature do not account for the direction of change between fuzzy sets; a useful concept in a…
The distance of closest approach of hard particles is a key parameter of their interaction and plays an important role in the resulting phase behavior. For non-spherical particles, the distance of closest approach depends on orientation,…
Computational difficulty of quadratic matching and the Gromov-Wasserstein distance has led to various approximation and relaxation schemes. One of such methods, relying on the notion of distance profiles, has been widely used in practice,…
The Fr\'echet distance is a popular distance measure for curves which naturally lends itself to fundamental computational tasks, such as clustering, nearest-neighbor searching, and spherical range searching in the corresponding metric…