Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem - Computer Information Systems and Industrial Management (CISIM 2016)
Conference Papers Year : 2016

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.

Domains

Computer Science [cs] Library and information sciences
Fichier principal
Vignette du fichier
419526_1_En_22_Chapter.pdf (369.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01637514

Submitted on : Friday, November 17, 2017-3:45:57 PM

Last modification on : Tuesday, December 7, 2021-3:33:15 PM

Long-term archiving on : Sunday, February 18, 2018-3:20:06 PM

Download

Dates and versions

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

Licence

Attribution

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC8 IFIP-CISIM
73 View
256 Download

Altmetric

Share

More