DocumentCode
2187376
Title
A minimum spanning ellipse algorithm
Author
Post, Mark J.
fYear
1981
fDate
28-30 Oct. 1981
Firstpage
115
Lastpage
122
Abstract
An algorithm to find the minimum spanning ellipse of a convex set of points in the plane, i.e., the ellipse of minimum area containing the set, is described. The result for higher dimensions is suggested, along with a brief discussion of possible applications.
Keywords
Algorithm design and analysis; Computer science; Ellipsoids; Object detection; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on
Conference_Location
Nashville, TN, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1981.7
Filename
4568325
Link To Document