Shortest Non-Crossing Walks in the Plane
Symposium on Discrete Algorithms(2011)
摘要
Let G be an n-vertex plane graph with non-negative edge weights, and let k terminal pairs be specified on h face boundaries. We present an algorithm to find k non-crossing walks in G of minimum total length that connect all terminal pairs, if any such walks exist, in 2O(h2)n log k time. The computed walks may overlap but may not cross each other or themselves. Our algorithm generalizes a result of Takahashi, Suzuki, and Nishizeki [Algorithmica 1996] for the special case h ≤ 2. We also describe an algorithm for the corresponding geometric problem, where the terminal points lie on the boundary of h polygonal obstacles of total complexity n, again in 2O(h2)n time, generalizing an algorithm of Papadopoulou [Int. J. Comput. Geom. Appl. 1999] for the special case h ≤ 2. In both settings, shortest non-crossing walks can have complexity exponential in h. We also describe algorithms to determine in O(n) time whether the terminal pairs can be connected by any non-crossing walks.
更多查看译文
关键词
shortest non-crossing,k non-crossing,k terminal pair,terminal pair,terminal point,h polygonal obstacle,n log k time,h face boundary,special case h,n time,non-crossing walk,plane graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络