On the empty convex partition of a finite set in the plane. (Q1861024)
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 the empty convex partition of a finite set in the plane. |
scientific article; zbMATH DE number 1877202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the empty convex partition of a finite set in the plane. |
scientific article; zbMATH DE number 1877202 |
Statements
On the empty convex partition of a finite set in the plane. (English)
0 references
2002
0 references
The authors discuss partitions of a finite set of points in the plane into empty convex polygons and into disjoint convex polygons. They improve upper and lower bounds in enumeration problems stated in [\textit{M. Urabe}, Discrete Appl. Math. 64, 179--191 (1996; Zbl 0849.52015)].
0 references
partition
0 references
disjoint partition
0 references
empty partition
0 references
0.8954688
0 references
0.89493847
0 references
0.8832853
0 references
0.8772082
0 references
0.8772082
0 references
0.87403834
0 references
