Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem

Krzysztof Misztal, Jacek Tabor, Jakub Hyła · Lecture notes in computer science · 2016

We propose a algorithm to give a approximate solution of a minimal covering circle or ellipse of a set of points. The iterative algorithm is based on the optimal ellipse which best describe a given set of points.

Read the paper · More papers on PaperTik