Learn More
Let S be a set with n = w + b points in general position in the plane, w of them white, and b of them black. We consider the problem of computing G(S), a largest non-crossing matching of pairs of points of the same color, using straight line segments. We present two new algorithms which compute a large matching, with an improved guarantee in the number of(More)
  • 1