Various modifications of optimum algorithm of construction of the minimal area ellipse

MaRDI QIDQ2745052zbMATH OpenFDO

Authors B. V. Rubl'ov

Publication date 9 October 2001

Published in Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

convex coverellipse of minimal areatriangle of maximum area

Mathematics Subject Classification ID

Elliptic curves (14H52) Elementary problems in Euclidean geometries (51M04) Convex sets in (2) dimensions (including convex curves) (52A10) Brownian motion (60J65)

Recommendations

• An algorithm for constructing of minimal volume ellipsoid
• Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• An algorithm for shape optimization in elliptic systems
• Algorithms of optimal packing construction in ellipse
• scientific article; zbMATH DE number 1296842
• Minimum-volume ellipsoids. Theory and algorithms
• A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

Cited in

(2)

• On the regularity of the growth of the modulus and argument of an entire function in the metric of L p [0, 2π]
• Minimum-Area ellipse containing a finite set of points. II

This page was built for publication: Various modifications of optimum algorithm of construction of the minimal area ellipse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2745052)