{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T07:58:52Z","timestamp":1790495932270,"version":"4.1.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1109\/cdc.2009.5399742","type":"proceedings-article","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T10:27:26Z","timestamp":1265106446000},"page":"1189-1194","source":"Crossref","is-referenced-by-count":2,"title":["A fast geometric algorithm for finding the minimum distance between two convex hulls"],"prefix":"10.1109","author":[{"given":"Dougsoo","family":"Kaown","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of North Texas, Denton, 75077, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianguo","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of North Texas, Denton, 75077, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","article-title":"A Geometric Algorithm for Finding the Minimum Distance Between Two Convex Hulls","author":"dougsoo","year":"2009","journal-title":"Manuscript"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.281794"},{"key":"ref10","first-page":"38","article-title":"Finding the point of a polyhedron closest to the origin","volume":"13","author":"mitchell","year":"1971","journal-title":"Vestinik Leningrad Gos Univ"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/56.2083"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0312003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0304007"},{"key":"ref12","first-page":"185","article-title":"Fast training of support vector machines using sequential minimal optimization","author":"platt","year":"1999","journal-title":"Advances in Kernel Methods-Support Vector Learning"},{"key":"ref8","author":"lay","year":"1982","journal-title":"Convex Sets and Their Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/72.822516"},{"key":"ref2","author":"chang","year":"2001","journal-title":"LIBSVM A library for support vector machines"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.145"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1997.606761"}],"event":{"name":"2009 Joint 48th IEEE Conference on Decision and Control (CDC) and 28th Chinese Control Conference (CCC)","location":"Shanghai, China","start":{"date-parts":[[2009,12,15]]},"end":{"date-parts":[[2009,12,18]]}},"container-title":["Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5379695\/5399469\/05399742.pdf?arnumber=5399742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T04:57:38Z","timestamp":1769489858000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5399742\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/cdc.2009.5399742","relation":{},"subject":[],"published":{"date-parts":[[2009,12]]}}}