乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T12:17:41Z","timestamp":1712319461553},"reference-count":18,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2013R1A1A1A05006927"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1016\/j.comgeo.2014.04.005","type":"journal-article","created":{"date-parts":[[2014,4,24]],"date-time":"2014-04-24T04:52:42Z","timestamp":1398315162000},"page":"779-788","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments"],"prefix":"10.1016","volume":"47","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2014.04.005_br0010","series-title":"The Farthest Color Voronoi Diagram and Related Problems","author":"Abellanas","year":"2006"},{"key":"10.1016\/j.comgeo.2014.04.005_br0020","series-title":"Handbook of Computational Geometry","article-title":"Voronoi diagrams","author":"Aurenhammer","year":"2000"},{"key":"10.1016\/j.comgeo.2014.04.005_br0030","series-title":"Proc. 6th Workshop Algo. Comput.","first-page":"40","article-title":"Tight bound for farthest-color Voronoi diagrams of line segments","author":"Bae","year":"2012"},{"key":"10.1016\/j.comgeo.2014.04.005_br0040","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"C-28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comgeo.2014.04.005_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","article-title":"An optimal algorithm for intersecting line segments in the plane","volume":"39","author":"Chazelle","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/j.comgeo.2014.04.005_br0060","series-title":"Proc. 15th Annu. Euro. Sympos. on Algorithms","first-page":"407","article-title":"Farthest-polygon Voronoi diagrams","volume":"vol. 4698","author":"Cheong","year":"2007"},{"key":"10.1016\/j.comgeo.2014.04.005_br0070","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2000"},{"key":"10.1016\/j.comgeo.2014.04.005_br0080","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","article-title":"Finding the upper envelope of n line segments in O(nlogn) time","volume":"33","author":"Hershberger","year":"1989","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.comgeo.2014.04.005_br0090","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02189323","article-title":"The upper envelope of Voronoi surfaces and its applications","volume":"9","author":"Huttenlocher","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2014.04.005_br0100","article-title":"Concrete and Abstract Voronoi Diagrams","volume":"vol. 400","author":"Klein","year":"1989"},{"key":"10.1016\/j.comgeo.2014.04.005_br0110","series-title":"Proc. IEEE 7th Int. Conf. Mobile Adhoc and Sensor Systems","first-page":"127","article-title":"Best and worst-case coverage problems for arbitrary paths in wireless sensor networks","author":"Lee","year":"2010"},{"key":"10.1016\/j.comgeo.2014.04.005_br0120","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","article-title":"Two-dimensional Voronoi diagrams in the Lp-metric","volume":"27","author":"Lee","year":"1980","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.comgeo.2014.04.005_br0130","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1142\/S0218195901000663","article-title":"Furthest site abstract Voronoi diagrams","volume":"11","author":"Mehlhorn","year":"2001","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1016\/j.comgeo.2014.04.005_br0140","series-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"Okabe","year":"2000"},{"key":"10.1016\/j.comgeo.2014.04.005_br0150","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/j.comgeo.2014.04.005_br0160","series-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"Sharir","year":"1995"},{"issue":"1","key":"10.1016\/j.comgeo.2014.04.005_br0170","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 Comput. Geom."},{"key":"10.1016\/j.comgeo.2014.04.005_br0180","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.tcs.2012.06.008","article-title":"Improved algorithms for the farthest colored Voronoi diagram of segments","volume":"497","author":"Zhu","year":"2013","journal-title":"Theor. Comput. Sci."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772114000546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772114000546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T18:25:06Z","timestamp":1538677506000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772114000546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["S0925772114000546"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2014.04.005","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2014,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2014.04.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}