{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:56:05Z","timestamp":1722938165507},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1145\/323233.323255","type":"proceedings-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T10:11:53Z","timestamp":1068804713000},"page":"161-167","source":"Crossref","is-referenced-by-count":21,"title":["Computing the largest empty convex subset of a set of points"],"prefix":"10.1145","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]}],"member":"320","event":{"number":"1","sponsor":["SIGACT, ACM Special Interest Group on Algorithms and Computation Theory","SIGGRAPH, ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"acronym":"SCG '85","name":"the first annual symposium","start":{"date-parts":[[1985,6,5]]},"location":"Baltimore, Maryland, United States","end":{"date-parts":[[1985,6,7]]}},"container-title":["Proceedings of the first annual symposium on Computational geometry - SCG '85"],"original-title":[],"link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=323255&ftid=248475&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T05:17:34Z","timestamp":1481865454000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=323233.323255"}},"subtitle":[],"proceedings-subject":"Computational geometry","short-title":[],"issued":{"date-parts":[[1985]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/323233.323255","relation":{},"subject":[],"published":{"date-parts":[[1985]]}}}