Faster counting empty convex polygons in a planar point set (Q2059898)
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: Faster counting empty convex polygons in a planar point set |
scientific article; zbMATH DE number 7444829
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster counting empty convex polygons in a planar point set |
scientific article; zbMATH DE number 7444829 |
Statements
Faster counting empty convex polygons in a planar point set (English)
0 references
14 December 2021
0 references
Erdös-Szekeres problem
0 references
counting problem
0 references
polygon
0 references
discrete geometry
0 references
computational geometry
0 references
