{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:30:31Z","timestamp":1722936631333},"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":[[1992]]},"DOI":"10.1145\/142675.142687","type":"proceedings-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T10:11:53Z","timestamp":1068804713000},"page":"33-42","source":"Crossref","is-referenced-by-count":6,"title":["Optimal parallel algorithms for triangulated simple polygons"],"prefix":"10.1145","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[]}],"member":"320","event":{"number":"8","sponsor":["SIGACT, ACM Special Interest Group on Algorithms and Computation Theory","SIGGRAPH, ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"acronym":"SCG '92","name":"the eighth annual symposium","start":{"date-parts":[[1992,6,10]]},"location":"Berlin, Germany","end":{"date-parts":[[1992,6,12]]}},"container-title":["Proceedings of the eighth annual symposium on Computational geometry - SCG '92"],"original-title":[],"link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=142687&ftid=47379&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T17:40:02Z","timestamp":1481823602000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=142675.142687"}},"subtitle":[],"proceedings-subject":"Computational geometry","short-title":[],"issued":{"date-parts":[[1992]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/142675.142687","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}