%0 Journal Article
%T An Algorithm for Finding the Smallest Circle Containing all Points in a Given Point Set<br>求一个包含点集所有点的最小圆的算法
%A WANG Wei
%A WANG Wen-ping
%A WANG Jia-ye
%A <br>汪卫
%A 王文平
%A 汪嘉业
%J 软件学报
%D 2000
%I 
%X To seek a smallest circle containing all the point 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 points given is presented. The time complexity of the algorithm is O(|lg(d/R)|*n), where R is the radius between the smallest circle, d is the smallest distance between the points of the set that are not on the circle and the circle.
%K Smallest circle
%K computational geometry<br>最小圆
%K 计算几何.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=03732952C8216110&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=9CF7A0430CBB2DFD&sid=72EB001A9B3C78CE&eid=4B24DA4DB6EBAD78&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=5