Proceedings of the 2018 8th International Conference on Management, Education and Information (MEICI 2018)

<Previous Article In Volume
Next Article In Volume>

A New Algorithm for the Smallest Enclosing Circle

Authors
Shang Gao, Changbao Wang
Corresponding Author
Shang Gao
Available Online December 2018.
DOI
10.2991/meici-18.2018.111How to use a DOI?
Keywords
Smallest enclosing circle; Computational geometry; Complexity
Abstract

The minimal enclosing circle is used in planning the location of a shared facility. The feature of the smallest enclosing circle problem is analyzed, and a simple algorithm for the smallest enclosing circle problem is presents. The algorithm is proved and its complexity is discussed. The time complexity of the algorithm is at the worst case. Numerical experiments show that the algorithm is simple and effective.

Copyright
© 2018, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2018 8th International Conference on Management, Education and Information (MEICI 2018)
Series
Advances in Intelligent Systems Research
Publication Date
December 2018
ISBN
978-94-6252-640-2
ISSN
1951-6851
DOI
10.2991/meici-18.2018.111How to use a DOI?
Copyright
© 2018, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Shang Gao
AU  - Changbao Wang
PY  - 2018/12
DA  - 2018/12
TI  - A New Algorithm for the Smallest Enclosing Circle
BT  - Proceedings of the 2018 8th International Conference on Management, Education and Information (MEICI 2018)
PB  - Atlantis Press
SP  - 562
EP  - 567
SN  - 1951-6851
UR  - https://doi.org/10.2991/meici-18.2018.111
DO  - 10.2991/meici-18.2018.111
ID  - Gao2018/12
ER  -