The minimum sphere covering a convex polyhedron

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1974 English Publisher:WileyJournal:Naval Research Logistics Quarterly, volume 21, pages 715-718 (issn: 0028-1441, eissn: 1931-9193,

Copyright policy )

Authors: Elzinga, Jack; Hearn, Donald;

doi: 10.1002/nav.3800210414

The minimum sphere covering a convex polyhedron

- Summary
- Subjects
- Metrics

Abstract

AbstractA 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.

Related Organizations

Keywords

Inequalities and extremum problems involving convexity in convex geometry, Integer programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	13
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average