Related papers: Shortest paths in arbitrary plane domains

In the semi-streaming model, an algorithm must process any $n$-vertex graph by making one or few passes over a stream of its edges, use $O(n \cdot \text{polylog }n)$ words of space, and at the end of the last pass, output a solution to the…

Let $\hat \Omega \subset \mathbb R^2$ be a bounded domain with smooth boundary and $\hat \sigma$ a smooth anisotropic conductivity on $\hat \Omega$. Starting from the Dirichlet-to-Neumann operator $\Lambda_{\hat \sigma}$ on $\partial \hat…

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path.…

A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another…

We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set $\mathcal{P}$ of $h$ pairwise-disjoint…

Given a set P of n points in the plane, the unit-disk graph G_{r}(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \in P if the Euclidean distance between p and q is at…

Minimum-time speed profiles are constructed for planar paths with smooth strictly-monotonic signed curvature, subject to constraints on velocity, normal acceleration and tangential acceleration. The construction is explicit and exact, and…

Shortest path algorithms have played a key role in the past century, paving the way for modern day GPS systems to find optimal routes along static systems in fractions of a second. One application of these algorithms includes optimizing the…

In this paper, we continue the study of the Hamiltonian and longest $(s, t)$-paths of supergrid graphs. The Hamiltonian $(s, t)$-path of a graph is a Hamiltonian path between any two given vertices $s$ and $t$ in the graph, and the longest…

The paper is concerned with elongating the shortest curvature-bounded path between two oriented points to an expected length. The elongation of curvature-bounded paths to an expected length is fundamentally important to plan missions for…

We introduce a blackbox framework that simplifies all known parallel algorithms with near-linear work for single-source reachability and shortest paths in directed graphs. Specifically, existing reachability algorithms rely on constructing…

This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists of a planar network where each road (edge) has an…

Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…

For any pseudoconvex Runge domain $\Omega\subset\mathbb{C}^2$ we prove that every closed discrete subset in $\Omega$ is contained in a properly embedded complex curve in $\Omega$ with any prescribed topology (possibly infinite).

In real life, it is always an urge to reach our goal in minimum effort i.e., it should have a minimum constrained path. The path may be shortest route in practical life, either physical or electronic medium. The scenario is to represents…

Let $\gamma$ be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if $\gamma$ is self-overlapping by geometrically constructing a combinatorial word from $\gamma$. More recently, Zipei Nie, in an…

We study the knapsack problem with graph theoretic constraints. That is, we assume that there exists a graph structure on the set of items of knapsack and the solution also needs to satisfy certain graph theoretic properties on top of…

Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_1$ shortest path queries in $P$. We build a data structure of $O(n)$ size in $O(n)$ time such that given any two query points $s$ and $t$, the length of an $L_1$ shortest…

This note discusses some geometrically defined seminorms on the group $\Ham(M, \omega)$ of Hamiltonian diffeomorphisms of a closed symplectic manifold $(M, \omega)$, giving conditions under which they are nondegenerate and explaining their…

We study the interplay between the recently defined concept of minimum homotopy area and the classical topic of self-overlapping curves. The latter are plane curves which are the image of the boundary of an immersed disk. Our first…