Finding the smallest triangles containing a given convex polygon (Q3697817): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q175047 / rank | |||
| Property / author | |||
| Property / author: Michael Chris Laskowski / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(85)90005-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069047468 / rank | |||
Normal rank | |||
Latest revision as of 02:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the smallest triangles containing a given convex polygon |
scientific article |
Statements
Finding the smallest triangles containing a given convex polygon (English)
0 references
1985
0 references
convex polygon
0 references
anchored triangle
0 references
polynomial algorithm
0 references
Hausdorff distance
0 references
local minimum
0 references
triangles of minimum area
0 references
