# Packing Plane Perfect Matchings into a Point Set

Abstract : 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 ⌊log2$n$⌋$-1$. For some special configurations of point sets, we give the exact answer. We also consider some restricted variants of this problem.
Keywords :
Document type :
Journal articles

Cited literature [40 references]

https://hal.inria.fr/hal-01349047
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, July 26, 2016 - 5:40:28 PM
Last modification on : Thursday, September 7, 2017 - 1:03:44 AM

### File

2758-9775-2-PB.pdf
Explicit agreement for this submission

### Citation

Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid. Packing Plane Perfect Matchings into a Point Set. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no.2 (2), pp.119-142. ⟨10.46298/dmtcs.2132⟩. ⟨hal-01349047⟩

Record views