Related papers: Shortest paths in planar domains with hyperbolic t…
A long series of recent results and breakthroughs have led to faster and better distributed approximation algorithms for single source shortest paths (SSSP) and related problems in the CONGEST model. The runtime of all these algorithms,…
The geodesic approximation is a powerful method for studying the dynamics of BPS solitons. However, there are systems, such as BPS monopoles in three-dimensional hyperbolic space, where this approach is not applicable because the moduli…
We study approximation and localized polynomial frames on a bounded double hyperbolic or conic surface and the domain bounded by such a surface and hyperplanes. The main work follows the framework developed recently in \cite{X21} for…
Many geometric machine learning and image analysis applications, require a left-invariant metric on the 5D homogeneous space of 3D positions and orientations SE(3)/SO(2). This is done in Equivariant Neural Networks (G-CNNs), or in PDE-Based…
This paper is a continuation of our paper about boundary rigidity and filling minimality of metrics close to flat ones. We show that compact regions close to a hyperbolic one are boundary distance rigid and strict minimal fillings. We also…
Uniformly quasiconformally homogeneous domains in $\mathbb{R}^n$ carry a transitive collection of $K$-quasiconformal maps for a fixed $K\geq 1.$ In this paper, we study two questions in this setting. The first is to show that…
We use a combinatorial approximation of the hyperbolic plane to investigate properties of hyperbolic geometry such as exponential growth of perimeter and area of disks, and the linear isoperimetric inequality. This calculations give a…
The Dijkstra algorithm is a classic path planning method, which operates in a discrete graph space to determine the shortest path from a specified source point to a target node or all other nodes based on non-negative edge weights. Numerous…
Given a group G acting on a geodesic metric space, we consider a preferred collection of paths of the space -- a path system -- and study the spectrum of relative exponential growth rates and quotient exponential growth rates of the…
F. Paulin proved that if the Gromov boundaries of two hyperbolic groups are quasi-Mobius equivalent, then the groups themselves are quasi-isometric. The goal of this article is to extend Paulin's result to the setting of relatively…
Object detection, for the most part, has been formulated in the euclidean space, where euclidean or spherical geodesic distances measure the similarity of an image region to an object class prototype. In this work, we study whether a…
The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in…
Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with…
In many robot motion planning problems, task objectives and physical constraints induce non-Euclidean geometry on the configuration space, yet many planners operate using Euclidean distances that ignore this structure. We address the…
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed…
Given two points in a simple polygon $P$ of $n$ vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within $P$. The geodesic center of $P$ is the unique point in $P$ that minimizes…
Minimal paths are regarded as a powerful and efficient tool for boundary detection and image segmentation due to its global optimality and the well-established numerical solutions such as fast marching method. In this paper, we introduce a…
Hyperbolic metric and different hyperbolic type metrics are studied in open sector domains of the complex plane. Several sharp inequalities are proven for them. Our main result describes the behavior of the triangular ratio metric under…
We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…
What is the shortest path between two data points lying in a high-dimensional space? While the answer is trivial in Euclidean geometry, it becomes significantly more complex when the data lies on a curved manifold -- requiring a Riemannian…