Work

Disjoint tree-compatible plane perfect matchings

Year: 2020

Type: conference-paper

Abstract: Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2. We show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter of this graph is either 4 or 5, independent of n.

Source: Institute of Science and Technology Austria

Authors: Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec

Institution: Institute of Science and Technology Austria

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Univerzita Karlova v Praze, Institute of Science and Technology Austria, European Commission, Austrian Science Fund

Awards: Arrangements and Drawings (ArrDra), Combinatorics of Networks and Computation, G6548433353

OpenAlex ID: W3138387637