乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T05:56:55Z","timestamp":1722146215934},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0925-7721(01)00036-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:51:33Z","timestamp":1027615893000},"page":"69-84","source":"Crossref","is-referenced-by-count":20,"title":["Polygons cuttable by a circular saw"],"prefix":"10.1016","volume":"20","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Craig S.","family":"Kaplan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/S0925-7721(01)00036-0_BIB001","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility of a polygon from an edge","volume":"30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput"},{"key":"10.1016\/S0925-7721(01)00036-0_BIB002","series-title":"Proc. of the 11th Canadian Conference on Computational Geometry, Vancouver, Canada","article-title":"Near-optimal partitioning of rectangles and prisms","author":"Bose","year":"1999"},{"issue":"1","key":"10.1016\/S0925-7721(01)00036-0_BIB003","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\/S0925-7721(01)00036-0_BIB004","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","article-title":"Visibility and intersection problems in plane geometry","volume":"4","author":"Chazelle","year":"1989","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/S0925-7721(01)00036-0_BIB005","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/S0925-7721(01)00036-0_BIB006","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","article-title":"A pedestrian approach to ray shooting: Shoot a ray, take a walk","volume":"18","author":"Hershberger","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(01)00036-0_BIB007","series-title":"Proc. of the 16th European Workshop on Computational Geometry, Eilat, Israel","first-page":"93","article-title":"The face-wise continuity in hot wire cutting of polyhedral sets","author":"Jaromczyk","year":"2000"},{"issue":"2","key":"10.1016\/S0925-7721(01)00036-0_BIB008","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/PL00009346","article-title":"Minimum convex partition of polygonal domains by guillotine cuts","volume":"19","author":"Martini","year":"1998","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/S0925-7721(01)00036-0_BIB009","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","article-title":"On-line construction of the convex hull of a simple polyline","volume":"25","author":"Melkman","year":"1987","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0925-7721(01)00036-0_BIB010","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","article-title":"Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems","volume":"28","author":"Mitchell","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00036-0_BIB011","series-title":"Handbook of Computational Geometry","first-page":"633","article-title":"Geometric shortest paths and network optimization","author":"Mitchell","year":"2000"},{"key":"10.1016\/S0925-7721(01)00036-0_BIB012","series-title":"Proc. of the 1st Annual ACM Symposium on Computational Geometry, Baltimore, MD","first-page":"316","article-title":"The complexity of cutting paper","author":"Overmars","year":"1985"},{"key":"10.1016\/S0925-7721(01)00036-0_BIB013","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s004540010050","article-title":"Cutting glass","volume":"24","author":"Pach","year":"2000","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/S0925-7721(01)00036-0_BIB014","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0031-3203(82)90057-7","article-title":"On a convex hull algorithm for polygons and its application to triangulation problems","volume":"15","author":"Toussaint","year":"1982","journal-title":"Pattern Recogn."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T15:20:30Z","timestamp":1556205630000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0925772101000360"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00036-0","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}