Related papers: Approximating the Directed Hausdorff Distance
In this paper, we apply the concept of asymptotic dimension to calculating Gromov-Hausdorff distances between some unbounded metric spaces. For example, we show that the Gromov--Hausdorff between $\mathbb{R}^2$ with the Euclidean metric and…
We compute the exact Hausdorff and packing measure of sets of real numbers whose digital expansions in a given base are missing the digits beyond a given threshold.
We study the $c$-approximate near neighbor problem under the continuous Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the curves into a…
In this paper, we study the metrical theory of Cartesian products of exact approximation sets in $\beta$-expansions. More precisely, for an integer $d \ge 2$ and real numbers $\beta_i > 1$ $(1 \le i \le d)$, we consider the set of points…
In this paper, we establish the Hausdorff dimensions of inverse images and collision time sets for a large class of symmetric Markov processes on metric measure spaces. We apply the approach in the works by Hawkes and Jain--Pruitt, and make…
We consider a stationary Poisson hyperplane process with given directional distribution and intensity in $d$-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body $K$ and consider the intersection…
Given a set $S$ of $n$ points in the plane, we study the two-line-center problem: finding two lines that minimize the maximum distance from each point in $S$ to its closest line. We present a $(1+\varepsilon)$-approximation algorithm for…
The aim of this article is to define and compare several distances (or metrics) between operators acting on different (separable) Hilbert spaces. We consider here three main cases of how to measure the distance between two bounded…
In the snippets problem, the goal is to preprocess text $T$ so that given two patterns $P_1$ and $P_2$, one can locate the occurrences of the two patterns in $T$ that are closest to each other, or report their distance. Kopelowitz and…
The Gromov-Hausdorff distance provides a metric on the set of isometry classes of compact metric spaces. Unfortunately, computing this metric directly is believed to be computationally intractable. Motivated by applications in shape…
We prove that, up to subpolynomial or polylogarithmic factors, there is no tradeoff between preprocessing time, query time, and size of exact distance oracles for planar graphs. Namely, we show how given an $n$-vertex weighted directed…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
The Fr\'echet distance is a popular distance measure between trajectories or curves in space, or between walks in graphs. We study computing the Fr\'echet distance between walks in the $d$-dimensional grid graphs, i.e. $\mathbb{Z}^d$ where…
The Frechet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Frechet distance a Frechet matching. There are often many different Frechet…
We compute the Hausdorff dimension of the set of $\psi$-exactly approximable vectors, in the simultaneous case, in dimension strictly larger than $2$ and for approximating functions $\psi$ with order at infinity less than or equal to $-2$.…
We consider preprocessing a set $S$ of $n$ points in convex position in the plane into a data structure supporting queries of the following form: given a point $q$ and a directed line $\ell$ in the plane, report the point of $S$ that is…
We report on experimental measurement of the Hilbert-Schmidt distance between two two-qubit states by many-particle interference. We demonstrate that our three-step method for measuring distances in Hilbert space is far less complex than…
The Fr\'echet distance is a commonly used similarity measure between curves. It is known how to compute the continuous Fr\'echet distance between two polylines with $m$ and $n$ vertices in $\mathbb{R}^d$ in $O(mn (\log \log n)^2)$ time;…
Given a persistence diagram with $n$ points, we give an algorithm that produces a sequence of $n$ persistence diagrams converging in bottleneck distance to the input diagram, the $i$th of which has $i$ distinct (weighted) points and is a…
We compute the Hausdorff dimension of the zero set of an additive Levy process.