An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924)
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: An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest |
scientific article; zbMATH DE number 7630075
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest |
scientific article; zbMATH DE number 7630075 |
Statements
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (English)
0 references
8 December 2022
0 references
\(k\)-gon
0 references
simple polygon
0 references
region of interest
0 references
area
0 references
perimeter
0 references
0.90071136
0 references
0 references
0.85776263
0 references
0.85142446
0 references
0.8469169
0 references
0.8464328
0 references
