Related papers: Shortest paths in arbitrary plane domains

Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In…

The orthogonality graph of an Okubo algebra with isotropic norm over an arbitrary field $\mathbb{F}$ is considered. Its connected components are described, and their diameters are computed. It is shown that there exist at most two shortest…

We prove that if $\Omega$ is a simply connected quadrature domain for a distribution with compact support and the infinity point belongs the boundary, then the boundary has an asymptotic curve that is either a straight line or a parabola or…

Given a rectilinear domain $\mathcal{P}$ of $h$ pairwise-disjoint rectilinear obstacles with a total of $n$ vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points $s$ and $t$ in…

Optimal path planning is prone to convergence to local, rather than global, optima. This is often the case for mobile manipulators due to nonconvexities induced by obstacles, robot kinematics and constraints. This paper focuses on planning…

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…

A connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is…

We study the construction of the minimum cost spanning geometric graph of a given rooted point set $P$ where each point of $P$ is connected to the root by a path that satisfies a given property. We focus on two properties, namely the…

Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…

We show that for any purely 2-unrectifiable metric space $M$, for example the Heisenberg group $\mathbb{H}^1$ equipped with the Carnot-Carath\'{e}odory metric, every homotopy class $[\gamma]$ of Lipschitz paths contains a length minimizing…

In this work we study shortest path problems in multimode graphs, a generalization of the min-distance measure introduced by Abboud, Vassilevska W. and Wang in [SODA'16]. A multimode shortest path is the shortest path using one of multiple…

We study the limiting behavior of minimizing $p$-harmonic maps from a bounded Lipschitz domain $\Omega \subset \mathbb{R}^{3}$ to a compact connected Riemannian manifold without boundary and with finite fundamental group as $p \nearrow 2$.…

We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular…

Let $G$ be a graph, $C$ a longest cycle in $G$ and $\overline{p}$, $\overline{c}$ the lengths of a longest path and a longest cycle in $G\backslash C$, respectively. Almost all lower bounds for the circumference base on a standard…

Let $p \in (1,\infty)$, $\alpha\in \mathbb{R}$, and $\Omega\subsetneq \mathbb{R}^N$ be a $C^{1,\gamma}$-domain with a compact boundary $\partial \Omega$, where $\gamma\in (0,1]$. Denote by $\delta_{\Omega}(x)$ the distance of a point $x\in…

We discuss the homotopy type and the cohomology of spaces of locally convex parametrized curves gamma: [0,1] -> S^2, i.e., curves with positive geodesic curvature. The space of all such curves with gamma(0) = gamma(1) = e_1 and gamma'(0) =…

For a set $Q$ of points in the plane and a real number $\delta \ge 0$, let $\mathbb{G}_\delta(Q)$ be the graph defined on $Q$ by connecting each pair of points at distance at most $\delta$. We consider the connectivity of…

For a given connected set $\Gamma$ in $d-$dimensional Euclidean space, we construct a connected set $\tilde\Gamma\supset \Gamma$ such that the two sets have comparable Hausdorff length, and the set $\tilde\Gamma$ has the property that it is…

Large optimal transport problems can be approached via domain decomposition, i.e. by iteratively solving small partial problems independently and in parallel. Convergence to the global minimizers under suitable assumptions has been shown in…

This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…