Related papers: MICC: A tool for computing short distances in the …
The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…
Let $G$ be a finite, connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ and the proximity $\pi(G)$ of $G$ are the maximum and…
A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…
We consider the problem $\min\int_{\mathbb{R}} \frac{1}{2}|\dot{\gamma}|^2+W(\gamma)\mathop{}\mathopen{}\mathrm{d} t $ among curves connecting two given wells of $W\geq 0$ and we reduce it, following a standard method, to a geodesic problem…
The geodesic edge center of a polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, where geodesic distance is the shortest path distance inside the polygon. We give a…
The choice of good distances and similarity measures between objects is important for many machine learning methods. Therefore, many metric learning algorithms have been developed in recent years, mainly for Euclidean data in order to…
This paper introduces a new mathematical formulation and numerical approach for the computation of distances and geodesics between immersed planar curves. Our approach combines the general simplifying transform for first-order elastic…
We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal…
The aim of this paper is to find an optimal matching between manifold-valued curves, and thereby adequately compare their shapes, seen as equivalent classes with respect to the action of reparameterization. Using a canonical decomposition…
This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…
For two multisets $S$ and $T$ of points in $[\Delta]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e.,…
A large number of powerful, high-quality, and open-source simulation packages exist to efficiently perform molecular dynamics simulations, and their prevalence has greatly accelerated discoveries across a wide range of scientific domains.…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…
We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $\Sigma$, including the minimum number of self-intersections, the minimum length of the words representing them in a…
Let $S_g$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of collections of $2g+1$ simple closed curves on $S_g$ which pairwise intersect exactly once, extending a result of the…
Computing geodesics for Riemannian manifolds is a difficult task that often relies on numerical approximations. However, these approximations tend to be either numerically unstable, have slow convergence, or scale poorly with manifold…
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…