Related papers: On Flipping the Fr\'{e}chet distance

This paper is aimed to study the ergodic short-term behaviour of discretizations of circle expanding maps. More precisely, we prove some asymptotics of the distance between the $t$-th iterate of Lebesgue measure by the dynamics $f$ and the…

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

Let $P$ be a polygon with $k$ vertices. Let $R$ and $B$ be two simple, interior disjoint curves on the boundary of $P$, with $n$ and $m$ vertices. We show how to compute the Fr\'echet distance between $R$ and $B$ using the geodesic…

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

We propose a novel iterative process to establish the minimum separation between two ellipsoids. The method maintains one point on each surface and updates their locations in the theta-phi parametric space. The tension along the connecting…

The Fr\'echet mean generalizes the concept of a mean to a metric space setting. In this work we consider equivariant estimation of Fr\'echet means for parametric models on metric spaces that are Riemannian manifolds. The geometry and…

We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

Providing various machine learning (ML) applications in the real world, concerns about discrimination hidden in ML models are growing, particularly in high-stakes domains. Existing techniques for assessing the discrimination level of ML…

We present a cut finite element method for the heat equation on two overlapping meshes: a stationary background mesh and an overlapping mesh that moves around inside/"on top" of it. Here the overlapping mesh is prescribed a simple…

It is known that the flip distance between two triangulations of a convex polygon is related to the minimum number of tetrahedra in the triangulation of some polyhedron. It is interesting to know whether these two numbers are the same. In…

Inverse optimization (Inverse optimal control) is the task of imputing a cost function such that given test points (trajectories) are (nearly) optimal with respect to the discovered cost. Prior methods in inverse optimization assume that…

A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…

Let $M$ be a simple 3-manifold such that one component of $\partial M$, say $F$, has genus at least two. For a slope $\alpha$ on $F$, we denote by $M(\alpha)$ the manifold obtained by attaching a 2-handle to $M$ along a regular neighborhood…

A directed graph, called an M-graph, is attached to every melody. Our chief concern in this paper is to investigate (1) how the positivity of the slope of the M-graph is related to singability of the melody, (2) when the M-graph has a…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

The \emph{metric dimension} of a graph $G$, denoted by $\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let $G_1$ and $G_2$ be disjoint copies of a graph $G$…

In this paper, we revisit the notion of length measures associated to planar closed curves. These are a special case of area measures of hypersurfaces which were introduced early on in the field of convex geometry. The length measure of a…

We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…

The challenge of describing model drift is an open question in unsupervised learning. It can be difficult to evaluate at what point an unsupervised model has deviated beyond what would be expected from a different sample from the same…