Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

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

Résumé

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.
Fichier principal
Vignette du fichier
419526_1_En_22_Chapter.pdf (369.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01637514 , version 1 (17-11-2017)

Licence

Paternité

Identifiants

Citer

Krzysztof Misztal, Jacek Tabor, Jakub Hyła. Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.240-250, ⟨10.1007/978-3-319-45378-1_22⟩. ⟨hal-01637514⟩
58 Consultations
206 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More