{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:27:51Z","timestamp":1648711671301},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0304-3975(90)90175-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"331-343","source":"Crossref","is-referenced-by-count":1,"title":["Construction of Voronoi diagrams in the plane by using maps"],"prefix":"10.1016","volume":"77","author":[{"given":"Mounir","family":"Elbaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Spehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0304-3975(90)90175-H_BIB1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","article-title":"Power diagrams: properties, algorithms and applications","volume":"16","author":"Aurenhammer","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90175-H_BIB2","first-page":"228","article-title":"An improved algorithm for constructing kth order Voronoi diagrams","author":"Chazelle","year":"1985","journal-title":"Proc. 1st ACM Symp. on Computational Geometry"},{"key":"10.1016\/0304-3975(90)90175-H_BIB3","article-title":"Un code pour les graphes planaires et ses applications","volume":"27","author":"Cori","year":"1975","journal-title":"Asterisque"},{"key":"10.1016\/0304-3975(90)90175-H_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01553877","article-title":"Primitives for the manipulation of three-dimensional subdivisions","volume":"4","author":"Dobkin","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(90)90175-H_BIB5","first-page":"646","article-title":"A combinatorial representation for polyhedral surfaces","volume":"7","author":"Edmonds","year":"1960","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/0304-3975(90)90175-H_BIB6","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0304-3975(90)90175-H_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Voronoi diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/0304-3975(90)90175-H_BIB8","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"},{"issue":"1","key":"10.1016\/0304-3975(90)90175-H_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0214006","article-title":"Voronoi diagrams in the Laguerre geometry and its applications","volume":"14","author":"Imai","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90175-H_BIB10","series-title":"Proc. STACS 88","first-page":"281","article-title":"Voronoi diagrams based on general metrics in the plane","volume":"294","author":"Klein","year":"1988"},{"key":"10.1016\/0304-3975(90)90175-H_BIB11","series-title":"Computational Geometry. An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0304-3975(90)90175-H_BIB12","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975","journal-title":"Proc. 16th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90175-H_BIB13","series-title":"Publications Laboratoire Mathematiques et Informatique","article-title":"Merging in maps and in pavings","author":"Spehner","year":"1989"},{"key":"10.1016\/0304-3975(90)90175-H_BIB14","series-title":"Graph Theory","author":"Tutte","year":"1984"},{"key":"10.1016\/0304-3975(90)90175-H_BIB15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/comjnl\/24.2.167","article-title":"Computing the n-dimensional Delaunay triangulation with applications to Voronoi polytopes","volume":"24","author":"Watson","year":"1981","journal-title":"Comput. J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090175H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090175H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:39Z","timestamp":1555127559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090175H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["030439759090175H"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90175-h","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}