DeepAI AI Chat
Log In Sign Up

The Very Best of Perfect Non-crossing Matchings

by   Ioannis Mantas, et al.
Berlin Institute of Technology (Technische Universität Berlin)
University of Novi Sad
USI Università della Svizzera italiana

Given a set of points in the plane, we are interested in matching them with straight line segments. We focus on perfect (all points are matched) non-crossing (no two edges intersect) matchings. Apart from the well known MinMax variation, where the length of the longest edge is minimized, we extend work by looking into different optimization variants such as MaxMin, MinMin, and MaxMax. We consider both the monochromatic and bichromatic versions of these problems and provide efficient algorithms for various input point configurations.


page 1

page 2

page 3

page 4


Flip Distance to some Plane Configurations

We study an old geometric optimization problem in the plane. Given a per...

Bottleneck Bichromatic Non-crossing Matchings using Orbits

Let R and B be sets of n red and n blue points in the plane, respectivel...

On problems related to crossing families

Given a set of points in the plane, a crossing family is a collection of...

On flips in planar matchings

In this paper we investigate the structure of a flip graph on non-crossi...

On Crossing-Families in Planar Point Sets

A k-crossing family in a point set S in general position is a set of k s...

Analogies between the crossing number and the tangle crossing number

Tanglegrams are special graphs that consist of a pair of rooted binary t...

Complexity Results on Untangling Red-Blue Matchings

Given a matching between n red points and n blue points by line segments...