Related papers: Shortest paths in arbitrary plane domains
Path planning is an important problem in robotics. One way to plan a path between two points $x,y$ within a (not necessarily simply-connected) planar domain $\Omega$, is to define a non-negative distance function $d(x,y)$ on…
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
Given a smooth manifold $M$ and a totally nonholonomic distribution $\Delta\subset TM$ of rank $d$, we study the effect of singular curves on the topology of the space of horizontal paths joining two points on $M$. Singular curves are…
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$…
We consider an inhomogeneous version of the Barak-Erd\H{o}s graph, i.e. a directed Er\H{o}s-R\'enyi random graph on $\{1,\ldots,n\}$ with no loop. Given $f$ a Riemann-integrable non-negative function on $[0,1]^2$ and $\gamma > 0$, we define…
Homotopy methods are attractive due to their capability of solving difficult optimisation and optimal control problems. The underlying idea is to construct a homotopy, which may be considered as a continuous (zero) curve between the…
We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…
Suppose that $M$ is a $2$-dimensional oriented Riemannian manifold, and let $\gamma$ be a simple closed curve on $M$. Let $m \gamma$ denote the curve formed by tracing $\gamma$ $m$ times. We prove that if $m \gamma$ is contractible through…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
It is proved that the number of shortest paths between two vertices of distance $t$ in a graph with degrees bounded by $\Delta$ is at most $2 \cdot (\frac{\Delta}{2})^t$. This improves upon the na\"ive $\Delta (\Delta-1) ^{t-1}$ bound.
We characterize geodesic paths in the $n$-dimensional unit sphere under sup norm. A geodesic path between two points is a shortest curve joining the two points.
A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with respect to the desired eccentricity. We…
In this paper, firstly, we will study the structure of the path complex $(\Omega_*(G;\Z),\partial)$ of a digraph $G$ via the $\Z$-generators of $\Omega_*(G,\Z)$ under strongly regular condition, which is called the minimal path in…
We show that the elastic energy $E(\gamma)$ of a closed curve $\gamma$ has a minimizer among all plane simple regular closed curves of given enclosed area $A(\gamma)$, and that the minimum is attained for a circle. The proof is of a…
A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for…
We prove a "gluing" theorem for monotone homotopies; a monotone homotopy is a homotopy through simple contractible closed curves which themselves are pairwise disjoint. We show that two monotone homotopies which have appropriate overlap can…
A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…