Related papers: Shortest paths in planar domains with hyperbolic t…
Given a domain $G \subsetneq \Rn$ we study the quasihyperbolic and the distance ratio metrics of $G$ and their connection to the corresponding metrics of a subdomain $D \subset G$. In each case, distances in the subdomain are always larger…
We establish constructive geometric tools for determining when a domain is $L^s$-averaging and obtain upper and lower bounds for the $L^s$-integrals of the quasihyperbolic distance. We also construct examples which are helpful to understand…
In this work we solve a couple of well known open problems related to the quasihyperbolic metric. In the case of planar domains, our first main result states that quasihyperbolic geodesics are unique in simply connected domains. As the…
Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input…
This is a tale describing the large scale geometry of Euclidean plane domains with their hyperbolic or quasihyperbolic distances. We prove that in any hyperbolic plane domain, hyperbolic and quasihyperbolic quasi-geodesics are the same…
Although the hyperbolic metric possesses many remarkable properties, it is not defined on arbitrary subdomains of $\mathbb{R}^n$ with $n \geq 2$. This article introduces a new hyperbolic-type metric that provides an alternative approach to…
The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…
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…
In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in…
We examine Euclidean plane domains with their hyperbolic or quasihyperbolic distance. We prove that the associated metric spaces are quasisymmetrically equivalent if and only if they are bi-Lipschitz equivalent. On the other hand, for…
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It has been observed recently that this strategy performs…
We consider the following questions: given a hyperbolic plane domain and a separation of its complement into two disjoint closed sets each of which contains at least two points, what is the shortest closed hyperbolic geodesic which…
We show the equivalence of several characterizations of relative hyperbolicity for metric spaces, and obtain extra information about geodesics in a relatively hyperbolic space. We apply this to characterize hyperbolically embedded subgroups…
Geodesic paths and distances are among the most popular intrinsic properties of 3D surfaces. Traditionally, geodesic paths on discrete polygon surfaces were computed using shortest path algorithms, such as Dijkstra. However, such algorithms…
We report a new algorithm for constructing pathways between local minima that involve a large number of intervening transition states on the potential energy surface. A significant improvement in efficiency has been achieved by changing the…
We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, the input resides in a read-only array that can be accessed…
In this paper, we investigate the asymptotics of shortest filling closed multi-geodesics of closed hyperbolic surfaces as systole $\to 0$ or as genus $\to \infty$. We first show that for a closed hyperbolic surface $X_g$ of genus $g$, the…
In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of $ n $ non-overlapping weighted disks in the plane. For a given parameter $ \varepsilon \in (0,1]$, the length of the approximate…
We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…
We present an algorithm to find an {\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of obstacles in $\Re^2$. Our algorithm takes $O(T+m(\lg{m})(\lg{n}))$ time and $O(n)$ space. Here, $O(T)$ is the…