File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Algorithm for finding the smallest circle containing all points in a given point set

TitleAlgorithm for finding the smallest circle containing all points in a given point set
Authors
Wang, WeiWang, WenpingWang, Jiaye
Issue Date2000
PublisherChinese Academy of Sciences, Institute of Software. The Journal's web site is located at http://www.jos.org.cn
Citation
Ruan Jian Xue Bao/Journal Of Software, 2000, v. 11 n. 9, p. 1237-1240 How to Cite?
AbstractTo 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.
Persistent Identifierhttp://hdl.handle.net/10722/152277
ISSN
1000-9825
2023 SCImago Journal Rankings: 0.305

 

DC FieldValueLanguage
dc.contributor.authorWang, Weien_US
dc.contributor.authorWang, Wenpingen_US
dc.contributor.authorWang, Jiayeen_US
dc.date.accessioned2012-06-26T06:36:53Z-
dc.date.available2012-06-26T06:36:53Z-
dc.date.issued2000en_US
dc.identifier.citationRuan Jian Xue Bao/Journal Of Software, 2000, v. 11 n. 9, p. 1237-1240en_US
dc.identifier.issn1000-9825en_US
dc.identifier.urihttp://hdl.handle.net/10722/152277-
dc.description.abstractTo 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.en_US
dc.languageengen_US
dc.publisherChinese Academy of Sciences, Institute of Software. The Journal's web site is located at http://www.jos.org.cnen_US
dc.relation.ispartofRuan Jian Xue Bao/Journal of Softwareen_US
dc.titleAlgorithm for finding the smallest circle containing all points in a given point seten_US
dc.typeArticleen_US
dc.identifier.emailWang, Wenping:wenping@cs.hku.hken_US
dc.identifier.authorityWang, Wenping=rp00186en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0034261947en_US
dc.identifier.volume11en_US
dc.identifier.issue9en_US
dc.identifier.spage1237en_US
dc.identifier.epage1240en_US
dc.publisher.placeChinaen_US
dc.identifier.scopusauthoridWang, Wei=7501755940en_US
dc.identifier.scopusauthoridWang, Wenping=35147101600en_US
dc.identifier.scopusauthoridWang, Jiaye=8384548600en_US
dc.identifier.issnl1000-9825-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats