Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segment in S crosses at most three edges of T .
Csaba D. Tóth, Michael Hoffmann