Related papers: Computing the Distance between Piecewise-Linear Bi…
Approximating distance is one of the key challenge in a facility location problem. Several algorithms have been proposed, however, none of them focused on estimating distance between two concave regions. In this work, we present an…
In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…
The Fr\'echet distance is a popular similarity measure between curves. For some applications, it is desirable to match the curves under translation before computing the Fr\'echet distance between them. This variant is called the Translation…
We establish the link between Mathematical Morphology and the map of Asplund's distances between a probe and a grey scale function, using the Logarithmic Image Processing scalar multiplication. We demonstrate that the map is the logarithm…
Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
Approximation by polynomials on a triangle is studied in the Sobolev space $W_2^r$ that consists of functions whose derivatives of up to $r$-th order have bounded $L^2$ norm. The first part aims at understanding the orthogonal structure in…
Let $(M^{2},g_{0})$ be a compact manifold with boundary, and let $g$ and $g_{0}$ be conformally related by $g=e^{2f}g_{0}$. We show that the inequality $$\nu_{1}(g)\geq\Big(\max_{x\in\partial M}e^{-f(x)}\Big)\nu_{1}(g_{0})$$ stated in…
A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…
The interleaving distance is arguably the most widely used metric in topological data analysis (TDA) due to its applicability to a wide array of inputs of interest, such as (multiparameter) persistence modules, Reeb graphs, merge trees, and…
For two d-dimensional point sets A, B of size up to n, the Chamfer distance from A to B is defined as CH(A,B) = \sum_{a \in A} \min_{b \in B} \|a-b\|. The Chamfer distance is a widely used measure for quantifying dissimilarity between sets…
The problem of fitting experimental data to a given model function $f(t; p_1,p_2,\dots,p_N)$ is conventionally solved numerically by methods such as that of Levenberg-Marquardt, which are based on approximating the Chi-squared measure of…
For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal…
This paper considers the problem of $L^p$-estimates for a certain multilinear functional involving integration against a kernel with the structure of a determinant. Examples of such objects are ubiquitous in the study of Fourier restriction…
We introduce a distance in the space of fully-supported probability measures on one-dimensional symbolic spaces. We compare this distance to the $\bar{d}$-distance and we prove that in general they are not comparable. Our projective…
In contrast to the univariate case, several definitions are available for the notion of bounded variation for a bivariate function. This article is an attempt to study the Hausdorff dimension and box dimension of the graph of a continuous…
The frame set of a function $g\in L^2(\mathbb{R})$ is the set of all parameters $(a, b)\in \mathbb{R}^2_+$ for which the collection of time-frequency shifts of $g$ along $a\mathbb{Z}\times b\mathbb{Z}$ form a Gabor frame for…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
We give a new derivation of the distance-dependent two-point function of planar quadrangulations by solving a new direct recursion relation for the associated slice generating functions. Our approach for both the derivation and the solution…
The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…