An Algorithm for Finding the Smallest Circle Containing all Points in a Given Point Set
Wei Wang, Wenping Wang, Jiaye Wang · The HKU Scholars Hub (University of Hong Kong) · 2000
To seek the smallest circle containing all the points of a given point set is an interesting problem in both practice and theory. In this paper, an algorithm of finding a smallest circle containing all the given points in a given point set is presented. The time complexity of the algorithm is O(|lg(d/R)|n), where R is the radius of the smallest circle and d is the smallest distance from the points of the set that are not on the circle to the circle.