Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon

DOI10.1016/0898-1221(87)90008-3zbMath0643.90051OpenAlexW2087286397MaRDI QIDQ1102184

B. George

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90008-3

zbMATH Keywords

convex polygongeometrical problemlargest circle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items (1)

Shakedown of elastic-perfectly plastic materials with temperature-dependent elastic moduli

Cites Work

• Finding the intersection of n half-spaces in time O(n log n)
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Continuous Skeletons from Digitized Images

This page was built for publication: Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon