Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01637514
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 3:45:57 PM
Last modification on : Thursday, October 4, 2018 - 10:12:02 PM
Long-term archiving on: : Sunday, February 18, 2018 - 3:20:06 PM

File

419526_1_En_22_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

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. 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⟩

Share

Metrics

Record views

105

Files downloads

237