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.
Optimal crossing-free Hamiltonian circuit drawings of Kn
1 Document citing this article
Source : OpenCitations
Ruiz-Vargas, Andres J.; Welzl, Emo, 2017, Crossing-Free Perfect Matchings In Wheel Point Sets, A Journey Through Discrete Mathematics, pp. 735-764, 10.1007/978-3-319-44479-6_30.