{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:35Z","timestamp":1725543095060},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_20","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"176-185","source":"Crossref","is-referenced-by-count":2,"title":["A PTAS for Cutting Out Polygons with Lines"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghui","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_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 length. European Journal of Operations Research\u00a088, 69\u201387 (1996)","journal-title":"European Journal of Operations Research"},{"key":"#cr-split#-20_CR2.1","doi-asserted-by":"crossref","unstructured":"Daescu, O., Luo, J.: Cutting out polygons with lines and rays. International Journal of Computational Geometry & Applications, 16(2-3), 227\u2013248 (2006);","DOI":"10.1142\/S0218195906002014"},{"key":"#cr-split#-20_CR2.2","unstructured":"In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 669\u2013680. Springer, Heidelberg (2004) (preliminary version)"},{"key":"20_CR3","doi-asserted-by":"crossref","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":"#cr-split#-20_CR4.1","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A.: An approximation algorithm for cutting out convex polygons. Computational Geometry: Theory and Applications\u00a029, 223\u2013231 (2004);","DOI":"10.1016\/j.comgeo.2004.01.010"},{"key":"#cr-split#-20_CR4.2","unstructured":"In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 823\u2013827 (2003) (preliminary version)"},{"issue":"1-3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.dam.2003.09.001","volume":"143","author":"A. Dumitrescu","year":"2004","unstructured":"Dumitrescu, A.: The cost of cutting out convex n-gons. Discrete Applied Mathematics\u00a0143(1-3), 353\u2013358 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: Proceedings of the 1st Annual ACM Symposium on Computational Geometry (SoCG 1985), pp. 316\u2013321 (1985)","DOI":"10.1145\/323233.323274"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s004540010050","volume":"24","author":"J. Pachand","year":"2000","unstructured":"Pachand, J., Tardos, G.: Cutting glass. Discrete Computational Geometry\u00a024, 481\u2013495 (2000)","journal-title":"Discrete Computational Geometry"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/11533719_54","volume-title":"Computing and Combinatorics","author":"X. Tan","year":"2005","unstructured":"Tan, X.: Approximation algorithms for cutting out polygons with lines and rays. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 534\u2013543. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:40Z","timestamp":1605644020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11809678_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}