On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
computational geometry
0 references
matching
0 references
visibility graph
0 references
0.88143206
0 references
0.87001026
0 references
0.8695533
0 references
0.8664851
0 references
0.8629905
0 references
0 references
0.85953176
0 references
0.8590187
0 references
Consider \(2n\) disjoint compact convex sets in the plane all having the same width in some direction.NEWLINENEWLINENEWLINEThe 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.NEWLINENEWLINENEWLINEThe paper ends with two conjectures.
0 references
