{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:09:15Z","timestamp":1773079755206,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0020-0190(91)90030-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"121-125","source":"Crossref","is-referenced-by-count":77,"title":["A simple algorithm for computing the smallest enclosing circle"],"prefix":"10.1016","volume":"37","author":[{"given":"Sven","family":"Skyum","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90030-L_BIB1","first-page":"491","article-title":"A linear time algorithm for computing the Voronoi diagram of a convex polygon","volume":"4","author":"Aggraval","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(91)90030-L_BIB2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90030-L_BIB3","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90030-L_BIB4","series-title":"Computational Geometry\u2014An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190030L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190030L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:23:38Z","timestamp":1555143818000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190030L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["002001909190030L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90030-l","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}