Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (Q1102184)
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: Publication:1102184 |
scientific article; zbMATH DE number 4049382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon |
scientific article; zbMATH DE number 4049382 |
Statements
Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (English)
0 references
1987
0 references
The geometrical problem of constructing the largest circle inscribed in a (given) convex polygon is solved in O(n) time. This problem is related to the construction of the skeleton of the polygon, which is shown to be accomplishable in O(n log n) time.
0 references
geometrical problem
0 references
largest circle
0 references
convex polygon
0 references
0.779821515083313
0 references
0.7780073285102844
0 references
0.7722557783126831
0 references
0.7699248194694519
0 references
