Ruy Fabila-Monroy

Learn More
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B ∪ R there is no edge connecting two blue points. We give the following bounds for the size of the smallest set R blocking B: (i) 3n/2 red points are always sufficient to block a set of n blue points, (ii) if B is in convex(More)
  • Springer Berlin, Heidelberg, Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D Demaine +9 others
  • 2009
Citation Aloupis, Greg et al. " Matching Points with Things. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract. Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We(More)
  • 1