The minimum sphere covering a convex polyhedron

Jack Elzinga and Donald Hearn

Naval Research Logistics Quarterly, 1974, vol. 21, issue 4, 715-718

Abstract: A finite algorithm is given for finding the smallest sphere enclosing a convex polyhedron in En described by a given system of linear equalities or inequalities. Extreme points of the polyhedron, and minimum spheres enclosing them, are generated in a systematic manner until the optimum is attained.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800210414

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:21:y:1974:i:4:p:715-718

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().