The notion of a minimum spanning ellipsoid in any dimension is explained. Basic definitions and theorems provide the ideas for an algorithm to find the minimum spanning ellipsoid of a set of points, i.e., the ellipsoid of minimum volume containing the set. The run-time of the algorithm O (n2) independent of dimension, where n is the number of points.

Article Free Access Share on Non-reversible privacy transformations Authors: Steven P. Reiss Brown University, Providence, RI Brown University, Providence, RIView Profile , Mark J. Post Brown University, Providence, RI Brown University, Providence, RIView Profile , Tore Dalenius Brown University, Providence, RI Brown University, Providence, RIView Profile Authors Info & Claims PODS '82: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systemsMarch 1982 Pages 139–146https://doi.org/10.1145/588111.588134Online:29 March 1982Publication History 14citation288DownloadsMetricsTotal Citations14Total Downloads288Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

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.