A New Algorithm for the Smallest Enclosing Circle
Shang Gao, Changbao Wang · Proceedings of the 2018 8th International Conference on Management, Education and Information (MEICI 2018) · 2018
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 ] ) 2 2 [( n O simple and effective.points as shown in Fig. 1(a).Then all points are in the intersection part of two circle as shown in Fig. 1.Obviously, you can find the smaller circle , which encloses intersection part as shown in Fig. 1(b).