Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (Q1102184): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Continuous Skeletons from Digitized Images / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the intersection of n half-spaces in time O(n log n) / rank | |||
Normal rank | |||
Latest revision as of 16:06, 18 June 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
