Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon
type: Item
instance of: scholarly article
title: Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon
zbMATH Open document ID: 0643.90051
DOI: 10.1016/0898-1221(87)90008-3
author: B. George
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 52Bxx
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4049382
zbMATH Keywords: geometrical problem
zbMATH Keywords: largest circle
zbMATH Keywords: convex polygon
MaRDI profile type: Publication
full work available at URL: 0898-1221(87)90008-3
OpenAlex ID: W2087286397
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs
cites work: Continuous Skeletons from Digitized Images
cites work: Finding the intersection of n half-spaces in time O(n log n)
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4049382