Abstract

Given a set PP of nn points in the plane, where nn is even, we consider the following question: How many plane perfect matchings can be packed into PP? We prove that at least ⌈log⁡2n⌉−2\lceil\log_2{n}\rceil-2 plane perfect matchings can be packed into any point set PP. For some special configurations of point sets, we give the exact answer. We also consider some extensions of this problem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.