{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:04Z","timestamp":1725567064211},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_54","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"534-543","source":"Crossref","is-referenced-by-count":8,"title":["Approximation Algorithms for Cutting Out Polygons with Lines and Rays"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0377-2217(94)00160-X","volume":"88","author":"J. Bhadury","year":"1996","unstructured":"Bhadury, J., Chandrasekaran, R.: Stock cutting to minimize cutting sequence. European Journal of Operational Research\u00a088, 69\u201387 (1996)","journal-title":"European Journal of Operational Research"},{"key":"54_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-540-30551-4_58","volume-title":"Algorithms and Computation","author":"O. Daescu","year":"2004","unstructured":"Daescu, O., Luo, J.: Cutting out polygons with lines and rays. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 669\u2013680. Springer, Heidelberg (2004)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0925-7721(01)00036-0","volume":"20","author":"E.D. Demaine","year":"2001","unstructured":"Demaine, E.D., Demaine, M.L., Kaplan, C.S.: Polygons cuttable by a circular saw. Computational Geometry: Theory and Applications\u00a020, 69\u201384 (2001)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.comgeo.2004.01.010","volume":"29","author":"A. Dumitrescu","year":"2004","unstructured":"Dumitrescu, A.: An approximation algorithm for cuttng out convex polygons. Computational Geometry: Theory and Applications\u00a029, 223\u2013231 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: Proc. of the 1st Annual ACM Symposium on Computational Geometry, pp. 316\u2013321 (1985)","DOI":"10.1145\/323233.323274"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:36:46Z","timestamp":1586471806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11533719_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}