Minimum Covering Ellipses

Authors:
  • BSB. W. Silverman
    B. W. Silverman
  • DTD. M. Titterington
    D. M. Titterington

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.

This publication has 18 references indexed in Scilit: