Minimum Monotone Spanning Trees

Abstract Given a finite set S of points in the plane and a finite set $$\mathcal {D}$$ D of directions, a geometric spanning tree T of S is $$\mathcal {D}$$ D -monotone if every path in T is monotone with respect to some direction in $$\mathcal {D}$$ D . We study the problem of computing, for a given point set S and a given set $$\mathcal {D}$$ D of directions, a minimum-length $$\mathcal{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 $$\mathcal {D}$$ D -monotone spanning tree of S over all possible sets $$\mathcal {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^2 \log n)$$ O ( n 2 log n ) and $$O(n^6)$$ 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_k$$ S k and a set $$\mathcal {D}_k$$ D k of k directions such that any minimum-length $$\mathcal {D}_k$$ D k -monotone spanning tree of $$S_k$$

Authors

Publication Details

Journal
Algorithmica
Published
2026-11-16
DOI
https://doi.org/10.1007/s00453-026-01409-0
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Minimum Monotone Spanning Trees

Antonios Symvonis, Alexander Wolff, Walter Didimo, Emilio Di Giacomo et al.
Algorithmica
Computational Geometry and Mesh Generation
article

Minimum Monotone Spanning Trees

Antonios Symvonis, Alexander Wolff, Walter Didimo, Emilio Di Giacomo, Lena Schlipf, Eleni Katsanou
article en

Abstract

Abstract Given a finite set S of points in the plane and a finite set $$\mathcal {D}$$ D of directions, a geometric spanning tree T of S is $$\mathcal {D}$$ D -monotone if every path in T is monotone with respect to some direction in $$\mathcal {D}$$ D . We study the problem of computing, for a given point set S and a given set $$\mathcal {D}$$ D of directions, a minimum-length $$\mathcal{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 $$\mathcal {D}$$ D -monotone spanning tree of S over all possible sets $$\mathcal {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^2 \log n)$$ O ( n 2 log n ) and $$O(n^6)$$ 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_k$$ S k and a set $$\mathcal {D}_k$$ D k of k directions such that any minimum-length $$\mathcal {D}_k$$ D k -monotone spanning tree of $$S_k$$

AlgorithmicaVol. 89(1)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon