{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:40:55Z","timestamp":1720201255016},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,7,29]],"date-time":"2017-07-29T00:00:00Z","timestamp":1501286400000},"content-version":"vor","delay-in-days":1489,"URL":"https:\/\/2.zoppoz.workers.dev:443\/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":[[2013,7]]},"DOI":"10.1016\/j.tcs.2012.06.008","type":"journal-article","created":{"date-parts":[[2012,6,10]],"date-time":"2012-06-10T11:21:31Z","timestamp":1339327291000},"page":"20-30","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Improved algorithms for the farthest colored Voronoi diagram of segments"],"prefix":"10.1016","volume":"497","author":[{"given":"Yongding","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.06.008_br000005","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2000"},{"issue":"6","key":"10.1016\/j.tcs.2012.06.008_br000010","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ipl.2006.07.008","article-title":"Farthest line segment Voronoi diagrams","volume":"100","author":"Aurenhammer","year":"2006","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.tcs.2012.06.008_br000015","doi-asserted-by":"crossref","unstructured":"D. Huttenlocher, K. Kedem, M. Sharir, The upper envelope of Voronoi surfaces and its applications, in: Proceedings of the 7th Annual Symposium on Computational Geometry, 1991, pp. 194\u2013203.","DOI":"10.1145\/109648.109670"},{"key":"10.1016\/j.tcs.2012.06.008_br000020","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, M. Sharir, Algorithmic Techniques for Geometric Optimization, 1995.","DOI":"10.1007\/BFb0015247"},{"key":"10.1016\/j.tcs.2012.06.008_br000025","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/j.tcs.2012.06.008_br000030","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S0218195998000047","article-title":"An output sensitive convex hull algorithm for planar objects","volume":"8","author":"Nielsen","year":"1995","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"10.1016\/j.tcs.2012.06.008_br000035","doi-asserted-by":"crossref","unstructured":"O. Cheong, H. Everett, M. Glisse, J. Gudmundsson, S. Hornus, S. Lazard, M. Lee, H. Na, Farthest-polygon Voronoi diagrams, in: Proceedings of the 15th Annual European Symposium on Algorithms, 2007, pp. 407\u2013418.","DOI":"10.1007\/978-3-540-75520-3_37"},{"key":"10.1016\/j.tcs.2012.06.008_br000040","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","article-title":"Optimal point location in a monotone subdivision","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM Journal on Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397512005440?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397512005440?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T17:39:16Z","timestamp":1561829956000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512005440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":8,"alternative-id":["S0304397512005440"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2012.06.008","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}