Related papers: MICC: A tool for computing short distances in the …
Let $C:f=0$ be a reduced curve in the complex projective plane. The minimal degree $mdr(f)$ of a Jacobian syzygy for $f$, which is the same as the minimal degree of a derivation killing $f$, is an important invariant of the curve $C$, for…
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) (resp. E(G)) is called the vertex (resp. edge) metric dimension of G. In [16] it was shown that both vertex and edge metric…
We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition components, with assignment cost proportional to transport…
The approximation of both geodesic distances and shortest paths on point cloud sampled from an embedded submanifold $\mathcal{M}$ of Euclidean space has been a long-standing challenge in computational geometry. Given a sampling resolution…
We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…
We initiate the study of computing shortest non-separating simple closed curves with some given topological properties on non-orientable surfaces. While, for orientable surfaces, any two non-separating simple closed curves are related by a…
Geodesic orbit spaces (or g.o. spaces) are defined as those homogeneous Riemannian spaces $(M=G/H,g)$ whose geodesics are orbits of one-parameter subgroups of $G$. The corresponding metric $g$ is called a geodesic orbit metric. We study the…
The minimum distance graph of an extended Preparata code P(m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is…
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on…
In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is…
We propose an optimization algorithm for computing geodesics on the universal Teichm\"uller space T(1) in the Weil-Petersson ($W P$) metric. Another realization for T(1) is the space of planar shapes, modulo translation and scale, and thus…
Distance metric learning aims to learn from the given training data a valid distance metric, with which the similarity between data samples can be more effectively evaluated for classification. Metric learning is often formulated as a…
We can associate with any irreducible curve singularity (ics) a numerical semigroup. Two ics are said to be equisingular if they have the same semigroup. Two equisingular ics have the same Milnor number. Conversely, The set of ics with a…
We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.
We give a metric characterization of the Euclidean sphere in terms of the lower bound of the sectional curvature and the length of the shortest closed geodesics.
Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…
The concept of a monitoring edge-geodetic set (MEG-set) in a graph $G$, denoted $MEG(G)$, refers to a subset of vertices $MEG(G)\subseteq V(G)$ such that every edge $e$ in $G$ is monitored by some pair of vertices $ u, v \in MEG(G)$, where…
We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance…
We study the problem of determining coordinated motions, of minimum total length, for two arbitrary convex centrally-symmetric (CCS) robots in an otherwise obstacle-free plane. Using the total path length traced by the two robot centres as…