scholarly journals Shortest paths in arbitrary plane domains

2020 ◽  
pp. 1-19
Author(s):  
L. C. Hoehn ◽  
L. G. Oversteegen ◽  
E. D. Tymchatyn

Abstract Let $\Omega $ be a connected open set in the plane and $\gamma : [0,1] \to \overline {\Omega }$ a path such that $\gamma ((0,1)) \subset \Omega $ . We show that the path $\gamma $ can be “pulled tight” to a unique shortest path which is homotopic to $\gamma $ , via a homotopy h with endpoints fixed whose intermediate paths $h_t$ , for $t \in [0,1)$ , satisfy $h_t((0,1)) \subset \Omega $ . We prove this result even in the case when there is no path of finite Euclidean length homotopic to $\gamma $ under such a homotopy. For this purpose, we offer three other natural, equivalent notions of a “shortest” path. This work generalizes previous results for simply connected domains with simple closed curve boundaries.

1973 ◽  
Vol 25 (3) ◽  
pp. 646-656
Author(s):  
W. S. Boyd ◽  
A. H. Wright

Let J be a simple closed curve in a 3-manifold M3. We say M — J is 1-ALG at p ∈ J (or has locally abelian fundamental group at p) if and only if for each sufficiently small open set U containing p, there is an open set V such that p ∈ V ⊂ U and each loop in V — J which bounds in U — J is contractible to a point in U — J.


1965 ◽  
Vol 17 ◽  
pp. 373-382 ◽  
Author(s):  
R. C. Mullin

Let R be a simply connected closed region in the Euclidean plane E2 whose boundary is a simple closed curve C. A triangular map, or simply "map," is a representation of R as the union of a finite number of disjoint point sets called cells, where the cells are of three kinds, vertices, edges, and faces (said to be of dimension 0, 1, and 2, respectively), where each vertex is a single point, each edge is an open arc whose ends are distinct vertices, and each face is a simply connected open region whose boundary consists of the closure of the union of three edges. Two cells of different dimension are incident if one is contained in the boundary of the other.


Fractals ◽  
2002 ◽  
Vol 10 (02) ◽  
pp. 223-227 ◽  
Author(s):  
JUN LUO ◽  
HUI RAO ◽  
BO TAN

We consider the attractor T of injective contractions f1, …, fm on R2 which satisfy the Open Set Condition. If T is connected, then T's interior T° is either empty or has no holes, and T's boundary ∂T is connected; if further T° is non-empty and connected, then ∂T is a simple closed curve, thus T is homeomorphic to the unit disk {x∈R2: |x|≤1}.


1981 ◽  
Vol 33 (2) ◽  
pp. 347-356
Author(s):  
D. G. Dickson

Let ϕ ≠ 0 be an entire function of one complex variable and of exponential type. Let B denote the set of all monomial exponentials of the form zneζ where ζ is a zero of ϕ of order greater than h. If R is a simply connected plane region and H(R) denotes the space of functions analytic in R with the topology of uniform convergence on compacta, then ϕ can be considered as an element of the topological dual H′(R) if the Borel transform of ϕ is analytic on , the complement of R. The duality is given bywhere C is a simple closed curve in the common region of analyticity of ƒ and , and C winds once around the complement of a set in which is analytic.


2021 ◽  
Vol 82 (1-2) ◽  
Author(s):  
Lena Collienne ◽  
Alex Gavryushkin

AbstractMany popular algorithms for searching the space of leaf-labelled (phylogenetic) trees are based on tree rearrangement operations. Under any such operation, the problem is reduced to searching a graph where vertices are trees and (undirected) edges are given by pairs of trees connected by one rearrangement operation (sometimes called a move). Most popular are the classical nearest neighbour interchange, subtree prune and regraft, and tree bisection and reconnection moves. The problem of computing distances, however, is $${\mathbf {N}}{\mathbf {P}}$$ N P -hard in each of these graphs, making tree inference and comparison algorithms challenging to design in practice. Although anked phylogenetic trees are one of the central objects of interest in applications such as cancer research, immunology, and epidemiology, the computational complexity of the shortest path problem for these trees remained unsolved for decades. In this paper, we settle this problem for the ranked nearest neighbour interchange operation by establishing that the complexity depends on the weight difference between the two types of tree rearrangements (rank moves and edge moves), and varies from quadratic, which is the lowest possible complexity for this problem, to $${\mathbf {N}}{\mathbf {P}}$$ N P -hard, which is the highest. In particular, our result provides the first example of a phylogenetic tree rearrangement operation for which shortest paths, and hence the distance, can be computed efficiently. Specifically, our algorithm scales to trees with tens of thousands of leaves (and likely hundreds of thousands if implemented efficiently).


Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 21
Author(s):  
Christoph Hansknecht ◽  
Imke Joormann ◽  
Sebastian Stiller

The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with respect to time-dependent travel times are widely desired. This holds in particular for the traveling salesman problem, which is a corner stone of logistic planning. In this paper, we devise column-generation-based IP methods to solve the TDTSP in full generality, both for arc- and path-based formulations. The algorithmic key is a time-dependent shortest path problem, which arises from the pricing problem of the column generation and is of independent interest—namely, to find paths in a time-expanded graph that are acyclic in the underlying (non-expanded) graph. As this problem is computationally too costly, we price over the set of paths that contain no cycles of length k. In addition, we devise—tailored for the TDTSP—several families of valid inequalities, primal heuristics, a propagation method, and a branching rule. Combining these with the time-dependent shortest path pricing we provide—to our knowledge—the first elaborate method to solve the TDTSP in general and with fully general time-dependence. We also provide for results on complexity and approximability of the TDTSP. In computational experiments on randomly generated instances, we are able to solve the large majority of small instances (20 nodes) to optimality, while closing about two thirds of the remaining gap of the large instances (40 nodes) after one hour of computation.


2010 ◽  
Vol 348 (9-10) ◽  
pp. 521-524 ◽  
Author(s):  
Stephen J. Gardiner ◽  
Nikolaos Tsirivas

Sign in / Sign up

Export Citation Format

Share Document