Minimum Monotone Spanning Trees

Abstract

Given a finite set $S$ of points in the plane and a finite set $\mathcal{D}$ of directions, a geometric spanning tree~$T$ of~$S$ is $\mathcal{D}$-monotone if every path in $T$ is monotone with respect to some direction in $\mathcal{D}$. We study the problem of computing, for a given point set $S$ and a given set $\mathcal{D}$ of directions, a minimum-length $\mathcal{D}$-monotone spanning tree of~$S$. We present a quadratic-time algorithm for two directions. More generally, we show that the problem belongs to the complexity class XP when parameterized by the number of directions. We further study, for a given positive integer $k$ and point set~$S$, the problem of finding a minimum-length $\mathcal{D}$-monotone spanning tree of $S$ over all possible sets~$\mathcal{D}$ of $k$ directions. We prove that this problem, too, is in XP when parameterized by~$k$, and present two algorithms that run in $O(n^2 \log n)$ and $O(n^6)$ time for $k=1$ and $k=2$, respectively, where $n$ is the number of points in~$S$. Finally, in contrast to the classical Euclidean minimum spanning tree of a set of points, whose vertex degree is bounded by six, we show that for every even integer~$k$, there exists a point set~$S_k$ and a set $\mathcal{D}_k$ of $k$ directions such that any minimum-length $\mathcal{D}_k$-monotone spanning tree of $S_k$ has maximum vertex degree~$2k$.