An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
Let P be a set of n points in general position in the plane which is partitioned into color classes. P is said to be color-balanced if the number of points of each color is at most \(\lfloor n/2\rfloor \). 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 \(2n/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 plane colored matching is a colored matching which is non-crossing. In this paper, we present an algorithm which computes a balanced cut for P in linear time. Consequently, we present an algorithm which computes a plane colored matching of P optimally in \(\Theta (n\log n)\) time.
KeywordsHull Sorting Univer Anil Kano
Unable to display preview. Download preview PDF.
- 1.The 1979 Putnam exam. In: Alexanderson, G.L., Klosinski, L.F., Larson, L.C. (eds.) The William Lowell Putnam Mathematical Competition Problems and Solutions: 1965–1984. Mathematical Association of America, USA (1985)Google Scholar
- 7.Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434–443 (1990)Google Scholar
- 9.Kano, M., Suzuki, K., Uno, M.: Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2013. LNCS, vol. 8845, pp. 96–111. Springer, Heidelberg (2014) Google Scholar
- 12.Sitton, D.: Maximum matchings in complete multipartite graphs. Furman University Electronic Journal of Undergraduate Mathematics 2, 6–16 (1996)Google Scholar
- 13.Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18(6) (1989)Google Scholar