Related papers: Distance in the curve graph
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
Let $S$ be an oriented surface of type $(g, n)$. We are interested in geodesics in the curve complex $\mathcal C(S)$ of $S$. In general, two $0$-simplexes in $\mathcal C(S)$ have infinitely many geodesics connecting the two simplexes while…
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fr\'echet distance between these curves is minimized. As a polygonal…
Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…
Random fields are mathematical structures used to model the spatial interaction of random variables along time, with applications ranging from statistical physics and thermodynamics to system's biology and the simulation of complex systems.…
The distance $d(u,v)$ between the vertices $u$ and $v$ of a connected graph $G$ is defined as the number of edges in a minimal path connecting them. The \emph{transmission} of a vertex $v$ of $G$ is defined by $\sigma(v)=\sum\limits_{u\in…
We provide an elementary derivation of an orthogonal coordinate system for boundary layers around evolving smooth surfaces and curves based on the signed-distance function. We go beyond previous works on the signed-distance function and…
We introduce a notion of geodesic curvature $k_{\zeta}$ for a smooth horizontal curve $\zeta$ in a three-dimensional contact sub-Riemannian manifold, measuring how much a horizontal curve is far from being a geodesic. We show that the…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
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…
In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time.…
For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we…
In this paper, we present a new method for computing approximate geodesic distances. We introduce the wave method for approximating geodesic distances from a point on a manifold mesh. Our method involves the solution of two linear systems…
The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…
If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by…
The Serpinsky-Knopp curve is characterized as the only curve (up to isometry) that maps a unit segment onto a triangle of a unit area, so for any pair of points in the segment, the square of the distance between their images does not exceed…
We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance $1$ or distance $2$ apart.