On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:47, 5 March 2024
scientific article; zbMATH DE number 1687498
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane |
scientific article; zbMATH DE number 1687498 |
Statements
On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (English)
0 references
2001
0 references
Consider \(2n\) disjoint compact convex sets in the plane all having the same width in some direction. The author's main theorem says that always \([2n/3]\) pairs of the sets can be matched by disjoint line segments and that it is possible that not more than \([4n/5]\) pairs can be matched. The paper ends with two conjectures.
0 references
computational geometry
0 references
matching
0 references
visibility graph
0 references
