{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:18Z","timestamp":1725663378110},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:33:04Z","timestamp":1330183984000},"page":"424-433","source":"Crossref","is-referenced-by-count":3,"title":["A time-optimal parallel algorithm for the computing of Voronoi-diagrams"],"prefix":"10.1007","author":[{"given":"W.","family":"Preilowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Mumbeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"K.Mehlhorn: Data Structures and Algorithms 3: Multi-dimensional Searching and Computatonal Geometry, EATCS Monographs on Theoretical Computer Science, 1984, Springer-Verlag.","DOI":"10.1007\/978-3-642-69900-9"},{"key":"29_CR2","unstructured":"A.Aggarwal, B.Chazelle, L.Guibas, C.\u00d3'D\u00fanlaing, C.Yap: Parallel Computational Geometry, extendet abstract."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"A.Aggarwal, B.Chazelle, L.Guibas, C.\u00d3'D\u00fanlaing, C.Yap: Parallel Computational Geometry, submitted for publication in 1988.","DOI":"10.1007\/BF01762120"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"F.Aurenhammer: Power Diagrams: Properties, Algorithms and Applications, SIAM J. Comput. Vol. 16, February 1987, p. 78\u201396","DOI":"10.1137\/0216006"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:50Z","timestamp":1605629930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}