Bottleneck bichromatic plane matching of points
Given a set of n red points and n blue points in the plane, we are interested to match the red points with the blue points by straight line segments in such a way that the segments do not cross each other and the length of the longest segment is minimized. In general, this problem in NP-hard. We give exact solutions for some special cases of the input point set.
|Conference||26th Canadian Conference on Computational Geometry, CCCG 2014|
Biniaz, A. (Ahmad), Maheshwari, A, & Smid, M. (2014). Bottleneck bichromatic plane matching of points. Presented at the 26th Canadian Conference on Computational Geometry, CCCG 2014.