Bottleneck detour tree of points on a path

摘要

Every pair of points lying on a polygonal path P in the plane has a detour associated with it, which is the ratio between their distance along the path and their Euclidean distance. Given a set S of points along the path, this information can be encoded in a weighted complete graph on S. Among all spanning trees on this graph, a bottleneck spanning tree is one whose maximum edge weight is minimum. We refer to such a tree as a bottleneck detour tree of S. In other words, a bottleneck detour tree of S is a spanning tree in which the maximum detour (with respect to the original path) between pairs of adjacent points is minimum. We show how to find a bottleneck detour tree in expected O (n log(3) n + m) time, where P consists of m edges and vertical bar S vertical bar = n. (C) 2019 Elsevier B.V. All rights reserved.