{"title":"最小生成椭圆算法","authors":"Mark J. Post","doi":"10.1109/SFCS.1981.7","DOIUrl":null,"url":null,"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.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A minimum spanning ellipse algorithm\",\"authors\":\"Mark J. Post\",\"doi\":\"10.1109/SFCS.1981.7\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":224735,\"journal\":{\"name\":\"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1981.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1981.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
