Minimum Monotone Spanning Trees.

Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric representation of a given graph. More formally, given a finite set S of points in the plane and a finite set 𝒟 of directions, a geometric spanning tree T with vertex set S is 𝒟 -monotone if, for every pair {u,v} of vertices of T, there exists a direction d ∈𝒟 for which the unique path from u to v in T is monotone with respect to d. We provide a characterization of 𝒟 -monotone spanning trees. Based on it, we show that a 𝒟 -monotone spanning tree of minimum length can be computed in polynomial time if the number k=|𝒟| of directions is fixed, both when (i) the set 𝒟 of directions is prescribed and when (ii) the objective is to find a minimum-length 𝒟 -monotone spanning tree over all sets 𝒟 of k directions. For k = 2 , we describe algorithms that are much faster than those for the general case. Furthermore, in contrast to the classical Euclidean minimum spanning tree, whose vertex degree is at most six, we show that for every even integer k, there exists a point set S_k and a set 𝒟 of k directions such that any minimum-length 𝒟 -monotone spanning tree of S_k has maximum vertex degree 2k.