作者: Ahmad Biniaz , Michiel H. M. Smid , Prosenjit Bose , Anil Maheshwari
DOI:
关键词:
摘要: Given a set $P$ of $n$ points in the plane, where is even, we consider following question: How many plane perfect matchings can be packed into $P$? For general position prove lower bound ⌊log2$n$⌋$-1$. some special configurations point sets, give exact answer. We also restricted variants this problem.