Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (Q1102184): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0898-1221(87)90008-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087286397 / rank | |||
Normal rank | |||
Revision as of 20:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon |
scientific article |
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
