{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:14:40Z","timestamp":1725592480350},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019,1]]},"DOI":"10.1109\/ccwc.2019.8666451","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T19:58:55Z","timestamp":1552939135000},"page":"0030-0033","source":"Crossref","is-referenced-by-count":2,"title":["A Parallel Algorithm to Calculate an Approximation to the Order-K Voronoi Diagram using Java Streams and Thrust"],"prefix":"10.1109","author":[{"given":"Christian","family":"Trefftz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debaditya","family":"Gautam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Szakas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/355588.365103"},{"key":"ref3","article-title":"Parallel Algorithms to find the Voronoi Diagramd and the Order-K Voronoi Diagram","author":"trefftz","year":"2003","journal-title":"Proceedings of the Third Workshop on Massivelly Parallel Processing (IPDPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/EIT.2008.4554342"},{"key":"ref5","article-title":"A Parallel Algorithm to Calculate an Approximation ot the Order-K Voronoi Diagram using Java Streams","author":"gautam","year":"2018","journal-title":"Master Project"},{"key":"ref8","first-page":"359","article-title":"Thrust: A productivity-oriented library for CUDA","author":"bell","year":"2011","journal-title":"GPU Computing Gems – Jade edition"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISVD.2007.41"},{"key":"ref2","first-page":"478","article-title":"On K-Nearest Neighbor Voronoi Diagrams in the plane","author":"lee","year":"1982","journal-title":"IEEE Transactions on Computers"},{"journal-title":"Data Structures and Algorithm Analysis in C++","year":"2012","author":"weiss","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"}],"event":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","start":{"date-parts":[[2019,1,7]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2019,1,9]]}},"container-title":["2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8663971\/8666184\/08666451.pdf?arnumber=8666451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:48:38Z","timestamp":1658080118000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8666451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/ccwc.2019.8666451","relation":{},"subject":[],"published":{"date-parts":[[2019,1]]}}}