Related papers: Shortest paths in planar domains with hyperbolic t…
Learning in hyperbolic spaces has attracted increasing attention due to its superior ability to model hierarchical structures of data. Most existing hyperbolic learning methods use fixed distance measures for all data, assuming a uniform…
This article explores closed geodesics on hyperbolic surfaces. We show that, for sufficiently large $k$, the shortest closed geodesics with at least $k$ self-intersections, taken among all hyperbolic surfaces, all lie on an ideal pair of…
For an integer $k\geq 1$, the objective of \textsc{$k$-Geodesic Center} is to find a set $\mathcal{C}$ of $k$ isometric paths such that the maximum distance between any vertex $v$ and $\mathcal{C}$ is minimised. Introduced by Gromov,…
Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…
We define metrics in space that are natural counterparts of the hyperbolic metric in plane domains, using the characterization of the hyperbolic metric due to Beardon and Pommerenke. We obtain inequalities for these metrics under…
It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces. Consequently, many tools of machine learning were extended to such spaces, but only few…
We introduce several new functions that measure the distance between two points $x$ and $y$ in a domain $G\subsetneq\mathbb{R}^n$ by using the arithmetic or the logarithmic mean of the Euclidean distances from the points $x$ and $y$ to the…
This paper proves under certain conditions the existence of an algorithm, which detects relatively quasiconvex subgroups $H$ of relatively hyperbolic groups $(G,\mathbb{P})$. Additionally, this algorithm outputs an induced peripheral…
In this paper, we obtain the minimal length of a filling (multi-)geodesic on a genus $g$ hyperbolic surface in the moduli space of hyperbolic surfaces and show that it is realized by the geodesic whose complement is a right-angled regular…
In this paper, we propose a new method for path planning to a point for robot in environment with obstacles. The resulting algorithm is implemented as a simple variation of Dijkstra's algorithm. By adding a constraint to the shortest-path,…
Given a pair of points in the hyperbolic half plane or the unit disk, we provide a simple construction of the midpoint of the hyperbolic geodesic segment joining the points.
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…
Hyperbolic tilings are natural infinite planar graphs where each vertex has degree $q$ and each face has $p$ edges for some $\frac1p+\frac1q<\frac12$. We study the structure of shortest paths in such graphs. We show that given a set of $n$…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
In this paper, orthogonal projection along a geodesic to the chosen k-plane is introduced using edge and Gram matrix of an n-simplex in hyperbolic or spherical n-space. The distance from a point to k-plane is obtained by the orthogonal…
We study relations between maps between relatively hyperbolic groups/spaces and quasisymmetric embeddings between their boundaries. More specifically, we establish a correspondence between (not necessarily coarsely surjective)…
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC'94]. The second is Fakcharoenphol…
Given a `cost' functional $F$ on paths $\gamma$ in a domain $D\subset\mathbb{R}^d$, in the form $F(\gamma) = \int_0^1 f(\gamma(t),\dot\gamma(t))dt$, it is of interest to approximate its minimum cost and geodesic paths. Let $X_1,\ldots, X_n$…
The second named author and David Kalaj introduced a pseudometric on any domain in the real Euclidean space $\mathbb R^n$, $n\ge 3$, defined in terms of conformal harmonic discs, by analogy with Kobayashi's pseudometric on complex…
Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods…