Related papers: Shortest paths in planar domains with hyperbolic t…
We study properties of "hyperbolic directions" in groups acting cocompactly on properly convex domains in real projective space, from three different perspectives simultaneously: the (coarse) metric geometry of the Hilbert metric, the…
We provide sharp estimates for the intrinsic distances of Finsler metrics with precise boundary estimates. These metrics include the Kobayashi-Hilbert metric near strongly convex points, the minimal metric near convex and strongly minimally…
Motivated by spectral asymptotics for orbital integrals in a relative trace formula, we generalize a number of geometric properties of geodesics in the hyperbolic plane, to maximal flat submanifolds of symmetric spaces of non-compact type.
We provide a new and elegant approach to relative quasiconvexity for relatively hyperbolic groups in the context of Bowditch's approach to relative hyperbolicity using cocompact actions on fine hyperbolic graphs. Our approach to…
Many graph processing algorithms require determination of shortest-path distances between arbitrary numbers of node pairs. Since computation of exact distances between all node-pairs of a large graph, e.g., 10M nodes and up, is…
Optimization based motion planning provides a useful modeling framework through various costs and constraints. Using Graph of Convex Sets (GCS) for trajectory optimization gives guarantees of feasibility and optimality by representing…
Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a…
We introduce a framework for solving a class of parabolic partial differential equations on triangle mesh surfaces, including the Hamilton-Jacobi equation and the Fokker-Planck equation. PDE in this class often have nonlinear or stiff terms…
Hyperbolic networks are supposed to be congruent with their underlying latent geometry and following geodesics in the hyperbolic space is believed equivalent to navigate through topological shortest paths (TSP). This assumption of…
Many robotics applications benefit from being able to compute multiple locally optimal paths in a given configuration space. Examples include path planning for of tethered robots with cable-length constraints, systems involving cables,…
We study the problem of computing shortest paths in so-called dense distance graphs. Every planar graph $G$ on $n$ vertices can be partitioned into a set of $O(n/r)$ edge-disjoint regions (called an $r$-division) with $O(r)$ vertices each,…
We study the problem of finding, for a given one-dimensional topological space $X$, a cover of $X$ of smallest size by geodesics with respect to some metric. The infimal size of such a set is called the metric geodesic cover number of $X$.…
It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the high computational complexity. In this paper, we propose a…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
This note is about a type of quantitative density of closed geodesics on closed hyperbolic surfaces. The main results are upper bounds on the length of the shortest closed geodesic that $\varepsilon$-fills the surface.
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…
In this note we develop a half-space model for the pseudo-hyperbolic space $\mathbb{H}^{p,q}$, for any $p,q$ with $p\geq 1$. This half-space model embeds isometrically onto the complement of a degenerate totally geodesic hyperplane in…
The main contribution of this paper is a novel method for planning globally optimal trajectories for dynamical systems subject to polygonal constraints. The proposed method is a hybrid trajectory planning approach, which combines graph…
We introduce a new heuristic for the A* algorithm that references a data structure significantly smaller than that of ALT. We characterize the behavior of this new heuristic based on a dual landmark configuration that leverages…
A furthest neighbor data structure on a metric space $(V,\mathrm{dist})$ and a set $P \subseteq V$ answers the following query: given $v \in V$, output $p \in P$ maximizing $\mathrm{dist}(v,p)$; in the approximate version, it is allowed to…