Answers are grounded in this paper and cite their sources.
Given a finite set S of points in the plane and a finite set D D of directions, a geometric spanning tree T of S is D D -monotone if every path in T is monotone with respect to some direction in D D . We study the problem of computing, for a given point set S and a given set D D of directions, a minimum-length D 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 D D -monotone spanning tree of S over all possible sets D 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² log n) O ( n 2 log n ) and O(n⁶) O ( n 6 ) time for $$k=1$$ k = 1 and $$k=2$$ 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ₖ S k and a set Dₖ D k of k directions such that any minimum-length Dₖ D k -monotone spanning tree of Sₖ
No takes yet. Share an insight, caveat, or question.
Giacomo et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: