Covering points with minimum/maximum area orthogonally convex polygons (Q283887)
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: Covering points with minimum/maximum area orthogonally convex polygons |
scientific article; zbMATH DE number 6580914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering points with minimum/maximum area orthogonally convex polygons |
scientific article; zbMATH DE number 6580914 |
Statements
Covering points with minimum/maximum area orthogonally convex polygons (English)
0 references
17 May 2016
0 references
orthogonally convex
0 references
polygon cover
0 references
optimal area
0 references
dynamic programming
0 references
numerical example
0 references
algorithm
0 references
0.95837724
0 references
0.9397646
0 references
0.92441225
0 references
0.92441225
0 references
0 references
0 references
0.90621424
0 references
0 references
0.90191674
0 references
