{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:05:08Z","timestamp":1780319108905,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:00:00Z","timestamp":1048204800000},"content-version":"vor","delay-in-days":3427,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0925-7721(93)90019-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"289-305","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["The complexity of finding minimal Voronoi covers with applications to machine learning"],"prefix":"10.1016","volume":"3","author":[{"given":"David","family":"Heath","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Kasif","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90019-3_BIB1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00181470","article-title":"Recognizing Dirichlet tessellations","volume":"19","author":"Ash","year":"1985","journal-title":"Geom. Dedicata"},{"key":"10.1016\/0925-7721(93)90019-3_BIB2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(93)90019-3_BIB3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90019-3_BIB4","doi-asserted-by":"crossref","first-page":"756","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\/0925-7721(93)90019-3_BIB5","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(93)90019-3_BIB6","article-title":"Learning with a helpful teacher","author":"Salzberg","year":"1990"},{"key":"10.1016\/0925-7721(93)90019-3_BIB7","first-page":"69","article-title":"Approximation of a tessellation of the plane by a Voronoi diagram","volume":"29","author":"Suzuki","year":"1986","journal-title":"J. Oper. Res. Soc. Japan"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900193?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900193?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:08:18Z","timestamp":1780315698000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772193900193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0925772193900193"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90019-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The complexity of finding minimal Voronoi covers with applications to machine learning","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0925-7721(93)90019-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}