Discrete & Computational Geometry

, Volume 40, Issue 3, pp 377–394

Tight Bounds for Connecting Sites Across Barriers

  • David Krumme
  • Eynat Rafalin
  • Diane L. Souvaine
  • Csaba D. Tóth
Article

Abstract

Given m points (sites) and n obstacles (barriers) in the plane, we address the problem of finding a straight line minimum cost spanning tree on the sites, where the cost is proportional to the number of intersections (crossings) between tree edges and barriers. If the barriers are infinite lines, it is known that there is a spanning tree such that every barrier is crossed by \(O(\sqrt{m}\,)\) tree edges, and this bound is asymptotically optimal. Asano et al. showed that if the barriers are pairwise disjoint line segments, then there is a spanning tree such that every barrier crosses at most 4 tree edges and so the total cost is at most 4n. Lower bound constructions are known with 3 crossings per barrier and 2n total cost.

We obtain tight bounds on the minimum cost of spanning trees in the special case where the barriers are interior disjoint line segments that form a convex subdivision of the plane and there is a point in every cell of the subdivision. In particular, we show that there is a spanning tree such that every barrier crosses at most 2 tree edges, and there is a spanning tree of total cost 5n/3. Both bounds are the best possible.

Keywords

Crossing number Spanning trees 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • David Krumme
    • 1
  • Eynat Rafalin
    • 2
  • Diane L. Souvaine
    • 1
  • Csaba D. Tóth
    • 3
  1. 1.Department of Computer ScienceTufts UniversityMedfordUSA
  2. 2.Google Inc.Mountain ViewUSA
  3. 3.Department of MathematicsUniversity of CalgaryCalgaryCanada

Personalised recommendations