Related papers: Efficient geodesics in the curve complex and their…
Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…
This paper focuses on the statistical analysis of shapes of data objects called shape graphs, a set of nodes connected by articulated curves with arbitrary shapes. A critical need here is a constrained registration of points (nodes to…
Given a graph $G = (V,E)$, a \emph{perfect dominating set} is a subset of vertices $V' \subseteq V(G)$ such that each vertex $v \in V(G)\setminus V'$ is dominated by exactly one vertex $v' \in V'$. An \emph{efficient dominating set} is a…
We employ the curve shortening flow to establish three new results on the dynamics of geodesic flows of closed Riemannian surfaces. The first one is the stability, under $C^0$-small perturbations of the Riemannian metric, of certain flat…
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…
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…
Let S be a compact surface with boundary and F be the set of the orbits of a traversing flow on S. If the flow is generic, its orbit space is a spine G of S, namely G is a graph embedded in S and S is a regular neighbourhood of G. Moreover…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
Geometric consistency, i.e. the preservation of neighbourhoods, is a natural and strong prior in 3D shape matching. Geometrically consistent matchings are crucial for many downstream applications, such as texture transfer or statistical…
In this paper, we consider enumeration of geodesics on a polyhedron, where a geodesic means locally-shortest path between two points. Particularly, we consider the following preprocessing problem: given a point $s$ on a polyhedral surface…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
Suppose $S$ is a closed, oriented surface of genus at least two. This paper investigates the geometry of the homology multicurve complex, $\mathcal{HC}(S,\alpha)$, of $S$; a complex closely related to complexes studied by…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
There have been recent advances in the analysis and visualization of 3D symmetric tensor fields, with a focus on the robust extraction of tensor field topology. However, topological features such as degenerate curves and neutral surfaces do…
We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency, and neighborhood efficiently for intersection graphs on a circle, which…
Foucaud, Krishna and Lekshmi recently introduced the concept of monitoring edge-geodetic sets in graphs, and a related graph invariant. These are sets of vertices such that the removal of any edge changes the distance between some pair of…
This paper describes a new approach to the problem of the structural research of clusters based on the theory of geodetic and k-geodetic graphs. We firmly believe that this same approach can be used when solving problems of correlation…
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…
The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph…
We prove a quantitative estimate with a power saving error term for the number of filling closed geodesics of a given topological type and length $\leq L$ on an arbitrary closed, orientable, negatively curved surface. More generally, we…