Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon
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.
scientific article; zbMATH DE number 4049382