Compatible Geometric Matchings

This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings M and M of the same set of n points, for some k O(log n), there is a sequence of perfect matchings M = M0, M1, . . . , Mk = M , such that

• Type: Journal
• Year: 2008
• Where: ENDM
• Authors: Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood
• Keywords: ENDM 2008, Non-crossing Geometric Perfect, Paper Studies, Perfect Matchings