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

Abstract : 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.
Type de document :
Communication dans un congrès
Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.240-250, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_22〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01637514
Contributeur : Hal Ifip <>
Soumis le : vendredi 17 novembre 2017 - 15:45:57
Dernière modification le : samedi 18 novembre 2017 - 01:16:37

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

Krzysztof Misztal, Jacek Tabor, Jakub Hyła. Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem. Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.240-250, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_22〉. 〈hal-01637514〉

Partager

Métriques

Consultations de la notice

9