On the red/blue spanning tree problem

@article{Bereg2011OnTR,
  title={On the red/blue spanning tree problem},
  author={Sergey Bereg and Minghui Jiang and Boting Yang and Binhai Zhu},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={2459-2467}
}
A geometric spanning tree of a point set S is a tree whose vertex set is S and whose edge set is a set of non-crossing straight line segments with endpoints in S. Given a set of red points and a set of blue points in the plane, the red/blue spanning tree problem is to find a geometric spanning tree for red points and a geometric spanning tree for blue points such that the number of crossing points of the two trees is a minimum. If no three points are collinear, we show that the minimum number… CONTINUE READING