乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T05:47:53Z","timestamp":1720504073146},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1566247"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1525045","1317788"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"USDA NIFA","award":["MIN-98-G02"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1016\/j.comgeo.2016.07.004","type":"journal-article","created":{"date-parts":[[2016,7,22]],"date-time":"2016-07-22T15:58:19Z","timestamp":1469203099000},"page":"97-109","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Polygon guarding with orientation"],"prefix":"10.1016","volume":"58","author":[{"given":"Pratap","family":"Tokekar","sequence":"first","affiliation":[]},{"given":"Volkan","family":"Isler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2016.07.004_br0010","series-title":"Proceedings of the IEEE International Conference on Robotics and Automation","article-title":"Polygon guarding with orientation","author":"Tokekar","year":"2014"},{"key":"10.1016\/j.comgeo.2016.07.004_br0020","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"issue":"1","key":"10.1016\/j.comgeo.2016.07.004_br0030","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","article-title":"A combinatorial theorem in plane geometry","volume":"18","author":"Chvatal","year":"1975","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.comgeo.2016.07.004_br0040","series-title":"Handbook of Computational Geometry","first-page":"973","article-title":"Art gallery and illumination problems","author":"Urrutia","year":"2000"},{"issue":"6","key":"10.1016\/j.comgeo.2016.07.004_br0050","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.dam.2009.12.004","article-title":"Approximation algorithms for art gallery problems in polygons","volume":"158","author":"Ghosh","year":"2010","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.comgeo.2016.07.004_br0060","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02574029","article-title":"An efficient algorithm for guard placement in polygons with holes","volume":"13","author":"Bjorling-Sachs","year":"1995","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2016.07.004_br0070","series-title":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science","first-page":"39","article-title":"The art gallery theorem for polygons with holes","author":"Hoffmann","year":"1991"},{"issue":"2","key":"10.1016\/j.comgeo.2016.07.004_br0080","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","article-title":"Some NP-hard polygon decomposition problems","volume":"29","author":"O'Rourke","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.comgeo.2016.07.004_br0090","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ipl.2006.05.014","article-title":"Guarding galleries and terrains","volume":"100","author":"Efrat","year":"2006","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.comgeo.2016.07.004_br0100","series-title":"Automata, Languages and Programming","first-page":"1362","article-title":"Approximate guarding of monotone and rectilinear polygons","author":"Nilsson","year":"2005"},{"key":"10.1016\/j.comgeo.2016.07.004_br0110","series-title":"Algorithms and Discrete Applied Mathematics: First International conference CALDAM 2015, Kanpur, India, February 8\u201310, 2015, Proceedings","first-page":"45","article-title":"Vertex guarding in weak visibility polygons","author":"Bhattacharya","year":"2015"},{"key":"10.1016\/j.comgeo.2016.07.004_br0120","series-title":"Canadian Conference on Computational Geometry","first-page":"76","article-title":"Triangle guarding","author":"Smith","year":"2003"},{"key":"10.1016\/j.comgeo.2016.07.004_br0130","series-title":"2nd International Conference on Broadband Networks","first-page":"714","article-title":"Approximation algorithms for two optimal location problems in sensor networks","author":"Efrat","year":"2005"},{"issue":"1","key":"10.1016\/j.comgeo.2016.07.004_br0140","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","article-title":"Almost optimal set covers in finite VC-dimension","volume":"14","author":"Br\u00f6nnimann","year":"1995","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/j.comgeo.2016.07.004_br0150","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0217003","article-title":"An optimal algorithm for finding a maximum independent set of a circular-arc graph","volume":"17","author":"Masuda","year":"1988","journal-title":"SIAM J. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772116300669?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772116300669?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T05:11:43Z","timestamp":1712466703000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772116300669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":15,"alternative-id":["S0925772116300669"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2016.07.004","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2016,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polygon guarding with orientation","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2016.07.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}