Abstract

We consider the problem of finding low-cost spanning trees for sets of n points in the plane,
where the cost of a spanning tree is defined as the total number of intersections of tree edges
with a given set of m barriers. We obtain the following results:
(i) if the barriers are possibly
... read more