Linear programming in R3 and the skeleton and largest incircle of a convex polygon

AbstractIn this paper the geometrical problem of constructing the largest circle inscribed in a (given) convex polygon is solved in 0(n) time. This problem is related to the construction of the skeleton of the polygon, which construction is shown to be accomplishable in 0(n log n) time