Geometry / Matching (Bibtex)

P425: Enumeration of all non-crossing perfect matchings (and convex partitions) in a given points

Input:

A point sets $P$ in a plane

Output:

All non-crossing perfect matchings (and convex partitions) in $P$.

Complexity:

After $O(2^nn^4)$ preprocessing time, polynomial delay.

Comment:

$n$ is the number of points in $P$

Reference:

[Wettstein2014] (Bibtex)