%0 Conference Proceedings
%T Optimal Ellipse Based Algorithm as an Approximate and Robust Solution of Minimum Volume Covering Ellipse Problem
%+ Uniwersytet Jagielloński w Krakowie = Jagiellonian University (UJ)
%+ AGH University of Science and Technology [Krakow, PL] (AGH UST)
%A Misztal, Krzysztof
%A Tabor, Jacek
%A Hyła, Jakub
%Z Part 4: Optimization, Tuning
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Vilnius, Lithuania
%Y Khalid Saeed
%Y Władysław Homenda
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-9842
%P 240-250
%8 2016-09-14
%D 2016
%R 10.1007/978-3-319-45378-1_22
%K Smallest ellipse problem
%K Computational geometry
%K Optimal ellipse
%K Online algorithm
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01637514/document
%2 https://inria.hal.science/hal-01637514/file/419526_1_En_22_Chapter.pdf
%L hal-01637514
%U https://inria.hal.science/hal-01637514
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-9842