{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:40Z","timestamp":1759639060867},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0304-3975(96)00024-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"193-202","source":"Crossref","is-referenced-by-count":2,"title":["A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon"],"prefix":"10.1016","volume":"174","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00024-2_BIB1","article-title":"A linear-time algorithm for computing the Voronoi diagram of a convex polygon","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(96)00024-2_BIB2","doi-asserted-by":"crossref","unstructured":"N.M. Amato, M.T. Goodrich and E.A. Ramos, Parallel algorithms for higher-dimensional convex hulls, in: Proc. 35th IEEE FOCS 683\u2013694.","DOI":"10.1109\/SFCS.1994.365724"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB3","article-title":"Voronoi diagrams \u2014 a survey","author":"Aurenhammer","year":"1988"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB4","doi-asserted-by":"crossref","unstructured":"O. Berkman, D. Breslauer, Z. Galil, B. Schieber and U. Vishkin, Highly parallelizable problems, in: Proc. 21st ACM STOC 309\u2013319.","DOI":"10.1145\/73007.73036"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB5","article-title":"Building Voronoi diagrams for convex polygons in linear expected time","author":"Chew","year":"1986","journal-title":"Manuscript"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","article-title":"New applications of random sampling in computational geometry","author":"Clarkson","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(96)00024-2_BIB7","series-title":"Proc. 4th ACM Symp. on Computational Geometry","first-page":"1","article-title":"Applications of random sampling in computational geometry II","author":"Clarkson","year":"1988"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB8","series-title":"Proc. 4th ACM Symp. on Computational Geometry","first-page":"12","article-title":"Algorithms for diametral pairs and convex hulls that are optimal, randomized and incremental","author":"Clarkson","year":"1988"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB9","series-title":"Proc. 4th ACM Symp. on Computational Geometry","article-title":"Optimal parallel algorithms for polygon and point-set problems","author":"Cole","year":"1988"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB10","doi-asserted-by":"crossref","unstructured":"R. Cole, M.T. Goodrich and C. \u00d3 D\u00fanlaing, Merging free trees in parallel for efficient Voronoi diagram construction, in: Proc. 17th ICALP, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin) 432\u2013445.","DOI":"10.1007\/BFb0032049"},{"issue":"1","key":"10.1016\/S0304-3975(96)00024-2_BIB11","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. Part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(96)00024-2_BIB12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1142\/S021819599200007X","article-title":"Randomization yields simple O(n log\u2217 n) algorithms for difficult \u03a9(n) problems","volume":"2","author":"Devillers","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"3","key":"10.1016\/S0304-3975(96)00024-2_BIB13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1142\/S0218195995000192","article-title":"On computing the Voronoi diagram for restricted planar figures","volume":"5","author":"Djidjev","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(96)00024-2_BIB14","article-title":"Algorithms in Combinatorial Geometry","volume":"Vol. 10","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB16","article-title":"Parallel Algorithms for Shared-Memory Machines","volume":"Vol. 1","author":"Karp","year":"1990"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB17","series-title":"Proc. 9th ACM Symp. on Computational Geometry","article-title":"A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon","author":"Klein","year":"1993"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB18","series-title":"Proc. Algorithms and Computation \u2014 ISAAC'94","article-title":"Hamiltonian abstract Voronoi diagrams in linear time","volume":"Vol. 834","author":"Klein","year":"1994"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB19","unstructured":"R. Kelin and A. Lingas, A note on generalizations of Chew's algorithm for the Voronoi diagram of a convex polygon, in: Proc. 5th CCCG 370\u2013374."},{"key":"10.1016\/S0304-3975(96)00024-2_BIB20","series-title":"Texts and Monographs in Theoretical Computer Science","article-title":"Computational geometry: an introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB21","doi-asserted-by":"crossref","unstructured":"S. Rajasekaran and J.H. Reif, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput. 18(3) 594\u2013607.","DOI":"10.1137\/0218041"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB22","series-title":"Proc. 21st STOC","first-page":"394","article-title":"Polling: A New Randomized Sampling Technique for Computational Geometry","author":"Reif","year":"1989"},{"key":"10.1016\/S0304-3975(96)00024-2_BIB23","article-title":"Parallel Computational Geometry: Exploiting polygonal order for optimally parallel algorithms","author":"Wagener","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000242?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000242?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:13Z","timestamp":1556522713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596000242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0304397596000242"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00024-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}