乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:33:20Z","timestamp":1740119600387,"version":"3.37.3"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I648-N18"],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003006","name":"ETH","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"COFUND"},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P23629-N18"],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["J-3847-N35"],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.comgeo.2017.05.003","type":"journal-article","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T18:15:19Z","timestamp":1494526519000},"page":"77-88","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Linear transformation distance for bichromatic matchings"],"prefix":"10.1016","volume":"68","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Luis","family":"Barba","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2017.05.003_br0010","series-title":"Proc. 30th Symposium on Computational Geometry (SOCG 2014)","first-page":"154","article-title":"Linear transformation distance for bichromatic matchings","author":"Aichholzer","year":"2014"},{"key":"10.1016\/j.comgeo.2017.05.003_br0020","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","article-title":"Compatible geometric matchings","volume":"42","author":"Aichholzer","year":"2009","journal-title":"Comput. Geom."},{"key":"10.1016\/j.comgeo.2017.05.003_br0030","series-title":"Proceedings of the XIV Encuentros de Geometr\u00eda Computacional (EGC 2011)","first-page":"145","article-title":"Compatible matchings in geometric graphs","author":"Aichholzer","year":"2011"},{"key":"10.1016\/j.comgeo.2017.05.003_br0040","series-title":"Proceedings of the 28th European Workshop on Computational Geometry (EuroCG 2012)","first-page":"257","article-title":"Compatible matchings for bichromatic plane straight-line graphs","author":"Aichholzer","year":"2012"},{"key":"10.1016\/j.comgeo.2017.05.003_br0050","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/j.comgeo.2014.08.009","article-title":"Bichromatic compatible matchings","volume":"48","author":"Aloupis","year":"2015","journal-title":"Comput. Geom."},{"key":"10.1016\/j.comgeo.2017.05.003_br0060","first-page":"185","article-title":"Quasi-parallel segments and characterization of unique bichromatic matchings","volume":"6","author":"Asinowski","year":"2015","journal-title":"J. Comput. Geom."},{"key":"10.1016\/j.comgeo.2017.05.003_br0070","doi-asserted-by":"crossref","first-page":"177","DOI":"10.4064\/fm-20-1-177-190","article-title":"Drei S\u00e4tze \u00fcber die n-dimensionale euklidische Sph\u00e4re","volume":"20","author":"Borsuk","year":"1933","journal-title":"Fundam. Math."},{"key":"10.1016\/j.comgeo.2017.05.003_br0080","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01377183","article-title":"Ray shooting in polygons using geodesic triangulations","volume":"12","author":"Chazelle","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2017.05.003_br0090","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/PL00009479","article-title":"Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions","volume":"22","author":"Eppstein","year":"1999","journal-title":"Discrete Comput. Geom."},{"year":"1997","series-title":"Handbook of Discrete and Computational Geometry","key":"10.1016\/j.comgeo.2017.05.003_br0100"},{"key":"10.1016\/j.comgeo.2017.05.003_br0110","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1007\/s00373-013-1320-1","article-title":"Vertex-colored encompassing graphs","volume":"30","author":"Hoffmann","year":"2014","journal-title":"Graphs Comb."},{"key":"10.1016\/j.comgeo.2017.05.003_br0120","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.comgeo.2007.05.006","article-title":"Encompassing colored planar straight line graphs","volume":"39","author":"Hurtado","year":"2008","journal-title":"Comput. Geom."},{"key":"10.1016\/j.comgeo.2017.05.003_br0130","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00454-012-9466-9","article-title":"Disjoint compatible geometric matchings","volume":"49","author":"Ishaque","year":"2013","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2017.05.003_br0140","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1137\/100804310","article-title":"Shooting permanent rays among disjoint polygons in the plane","volume":"41","author":"Ishaque","year":"2012","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.comgeo.2017.05.003_br0150","series-title":"Discrete and Computational Geometry, The Goodman\u2013Pollack Festschrift","first-page":"551","article-title":"Discrete geometry on red and blue points in the plane\u2014a survey","volume":"vol. 25","author":"Kaneko","year":"2003"},{"year":"1983","series-title":"Problem Solving through Problems","author":"Larson","key":"10.1016\/j.comgeo.2017.05.003_br0160"},{"key":"10.1016\/j.comgeo.2017.05.003_br0170","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF02574017","article-title":"Algorithms for ham-sandwich cuts","volume":"11","author":"Lo","year":"1994","journal-title":"Discrete Comput. Geom."},{"article-title":"Using the Borsuk\u2013Ulam Theorem","year":"2007","author":"Matou\u0161ek","key":"10.1016\/j.comgeo.2017.05.003_br0180"},{"key":"10.1016\/j.comgeo.2017.05.003_br0190","series-title":"Proceedings of the 24th European Workshop on Computational Geometry (EuroCG 2008)","first-page":"115","article-title":"A lower bound for the transformation of compatible perfect matchings","author":"Razen","year":"2008"},{"key":"10.1016\/j.comgeo.2017.05.003_br0200","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/050636036","article-title":"On the number of crossing-free matchings, cycles, and partitions","volume":"36","author":"Sharir","year":"2006","journal-title":"SIAM J. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772117300366?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772117300366?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T21:01:44Z","timestamp":1656882104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772117300366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":20,"alternative-id":["S0925772117300366"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2017.05.003","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linear transformation distance for bichromatic matchings","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2017.05.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}