Minimum Covering Ellipses
Copyright policy )Minimum Covering Ellipses
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.
Optimal statistical designs, convex hulls, Computing methodologies and applications, computational geometry, Packing and covering in \(n\) dimensions (aspects of discrete geometry), optimal design, Computer aspects of numerical algorithms
Optimal statistical designs, convex hulls, Computing methodologies and applications, computational geometry, Packing and covering in \(n\) dimensions (aspects of discrete geometry), optimal design, Computer aspects of numerical algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).51 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!