Problem of partitioning a planar point set into empty convex polygons (Q2824967)
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: Problem of partitioning a planar point set into empty convex polygons |
scientific article; zbMATH DE number 6635424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problem of partitioning a planar point set into empty convex polygons |
scientific article; zbMATH DE number 6635424 |
Statements
6 October 2016
0 references
general position
0 references
empty convex polygon
0 references
empty convex partition
0 references
0.9782343
0 references
0.92370796
0 references
0 references
0.9146634
0 references
0.9146634
0 references
0.91020805
0 references
0.90295553
0 references
0.89717305
0 references
Problem of partitioning a planar point set into empty convex polygons (English)
0 references
