Ahmad Biniaz;Prosenjit Bose;Anil Maheshwari;Michiel Smid
1 School of Computer Science [Ottawa]
Given a set P of n points in the plane, where n is even, we consider the following question: How many plane perfect matchings can be packed into P? For points in general position we prove the lower bound of ⌊log<sub>2</sub>n⌋−1. For some special configurations of point sets, we give the exact answer. We also consider some restricted variants of this problem.
Funder: Natural Sciences and Engineering Research Council of Canada
Bibliographic References
1 Document citing this article
Andres J. Ruiz-Vargas;Emo Welzl, Springer eBooks, Crossing-Free Perfect Matchings in Wheel Point Sets, pp. 735-764, 2017, 10.1007/978-3-319-44479-6_30.