Related papers: Geodesic Distance in Planar Graphs
The directed landscape is a random directed metric on the plane that arises as the scaling limit of metric models in the KPZ universality class. For a pair of points p, q, the disjointness gap G(p; q) measures the shortfall when we optimize…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…
We find an upper bound for geodesic distances associated to monotone Riemannian metrics on positive definite matrices and density matrices.
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, and analyze the structure and complexity of the…
We study the completeness of light trajectories in certain spherically symmetric regular geometries found in Palatini theories of gravity threaded by non-linear (electromagnetic) fields, which makes their propagation to happen along…
New results on the convexity of geodesic-length functions on Teichm\"{u}ller space are presented. A formula for the Hessian of geodesic-length is presented. New bounds for the gradient and Hessian of geodesic-length are described. A…
In this work we discuss an approach due to F. David to the geometry of world sheets of non-critical strings in quasiclassical approximation. The gravitational dressed conformal dimension is related to the scaling behavior of the two-point…
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…
We propose a notion of distance between two parametrized planar curves, called their discrepancy, and defined intuitively as the minimal amount of deformation needed to deform the source curve into the target curve. A precise definition of…
We consider the topological and geometric reconstruction of a geodesic subspace of $\mathbb{R}^N$ both from the \v{C}ech and Vietoris-Rips filtrations on a finite, Hausdorff-close, Euclidean sample. Our reconstruction technique leverages…
We first introduce a class of divergence measures between power spectral density matrices. These are derived by comparing the suitability of different models in the context of optimal prediction. Distances between "infinitesimally close"…
We endow the set of probability measures on a weighted graph with a Monge--Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have $n$ vertices and so, the boundary of the probability simplex…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
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…
We study the geodesic distance induced by right-invariant metrics on the group $\operatorname{Diff}_\text{c}(M)$ of compactly supported diffeomorphisms, for various Sobolev norms $W^{s,p}$. Our main result is that the geodesic distance…
This paper proposes a geodesic-distance-based feature that encodes global information for improved video segmentation algorithms. The feature is a joint histogram of intensity and geodesic distances, where the geodesic distances are…
A mated-CRT map is a random planar map obtained as a discretized mating of correlated continuum random trees. Mated-CRT maps provide a coarse-grained approximation of many other natural random planar map models (e.g., uniform triangulations…
Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…