An optimal algorithm for plane matchings in multipartite geometric graphs

@article{Biniaz2017AnOA,
  title={An optimal algorithm for plane matchings in multipartite geometric graphs},
  author={Ahmad Biniaz and Anil Maheshwari and Subhas C. Nandy and Michiel H. M. Smid},
  journal={Comput. Geom.},
  year={2017},
  volume={63},
  pages={1-9}
}
Abstract Let P be a set of n points in general position in the plane which is partitioned into color classes. The set P is said to be color-balanced if the number of points of each color is at most ⌊ n / 2 ⌋ . Given a color-balanced point set P , a balanced cut is a line which partitions P into two color-balanced point sets, each of size at most 2 n / 3 + 1 . A colored matching of P is a perfect matching in which every edge connects two points of distinct colors by a straight line segment. A… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.