Minimum Covering Ellipses
Authors:
- B. W. SilvermanBSB. W. Silverman
- D. M. TitteringtonDTD. M. Titterington
- 1 December 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 1 (4) , 401-409
Abstract
With the aid of a duality relation originally obtained in the theory of statistical experimental design, an exact terminating algorithm is developed for finding the ellipse of smallest area covering a given plane point set. Some applications and related problems are discussed. Empirical timings show the algorithm to be highly efficient, particularly for large sets of points.Keywords
This publication has 18 references indexed in Scilit:
- A note on finding convex hulls via maximal vectorsInformation Processing Letters, 1980
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- Minimax Multifacility Location with Euclidean DistancesTransportation Science, 1976
- The Ordering of Multivariate DataJournal of the Royal Statistical Society. Series A (General), 1976
- The minimum sphere covering a convex polyhedronNaval Research Logistics Quarterly, 1974
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972
- The Minimum Covering Sphere ProblemManagement Science, 1972
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972