Skip to main content
Conference ProceedingsOPEN ACCESS

Optimal ellipse based algorithm as an approximate and robust solution of minimum volume covering ellipse problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9842 LNCS 240-250
DOI: 10.1007/978-3-319-45378-1_22
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Misztal, K., Tabor, J., & Hyła, J. (2016). Optimal ellipse based algorithm as an approximate and robust solution of minimum volume covering ellipse problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9842 LNCS, pp. 240–250). Springer Verlag. https://doi.org/10.1007/978-3-319-45378-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free