Related papers: Geodesic Distance in Planar Graphs: An Integrable …
On a complete, connected, locally compact, non-compact geodesic space $(X,d)$, we assign each compact set a distance-like function. With the help of these functions, we obtain a pseudo-metric on the space of (non-empty) compact subsets of…
Sato theory provides a correspondence between solutions to the KP hierarchy and points in an infinite dimensional Grassmannian. In this correspondence, flows generated infinitesimally by powers of the ``shift'' operator give time dependence…
We apply the techniques of computable model theory to the distance function of a graph. This task leads us to adapt the definitions of several truth-table reducibilities so that they apply to functions as well as to sets, and we prove…
Distance functions are crucial in robotics for representing spatial relationships between a robot and its environment. They provide an implicit, continuous, and differentiable representation that integrates seamlessly with control,…
In this paper we exploit the concept of extended Pareto grid to study the geometric properties of the matching distance for $\mathbb{R}^2$-valued regular functions defined on a Riemannian closed manifold. In particular, we prove that in…
Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…
Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper, we present a geometric approach to analyzing contractive and…
We propose that large quantum fluctuations of the conformal factor drastically modify classical general relativity at cosmological distance scales, resulting in a scale invariant phase of quantum gravity in the far infrared. We derive…
This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…
The model of p Ising spins coupled to 2d gravity, in the form of a sum over planar phi-cubed graphs, is studied and in particular the two-point and spin-spin correlation functions are considered. We first solve a toy model in which only 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.…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such…
Given a graph $G$, a geodesic packing in $G$ is a set of vertex-disjoint maximal geodesics, and the geodesic packing number of $G$, ${\gpack}(G)$, is the maximum cardinality of a geodesic packing in $G$. It is proved that the decision…
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…
In this manuscript, an original numerical procedure for the nonlinear peridynamics on arbitrarily--shaped two-dimensional (2D) closed manifolds is proposed. When dealing with non parameterized 2D manifolds at the discrete scale, the problem…
A new technique for the study of geodesic connectedness in a class of Lorentzian manifolds is introduced. It is based on arguments of Brouwer's topological degree for the solution of functional equations. It is shown to be very useful for…
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the…