{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:50Z","timestamp":1725638210423},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_25","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"230-239","source":"Crossref","is-referenced-by-count":0,"title":["Cutting Out Polygons with a Circular Saw"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Masud","family":"Hasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.4304\/jcp.5.1.4-11","volume":"5","author":"S.I. Ahmed","year":"2010","unstructured":"Ahmed, S.I., Hasan, M., Islam, M.A.: Cutting a cornered convex polygon out of a circle. Journal of Computers\u00a05(1), 4\u201311 (2010)","journal-title":"Journal of Computers"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00373-011-1018-1","volume":"27","author":"S.I. Ahmed","year":"2011","unstructured":"Ahmed, S.I., Hasan, M., Islam, M.A.: Cutting a convex polyhedron out of a sphere. Graphs and Combinatorics\u00a027(3), 307\u2013319 (2011)","journal-title":"Graphs and Combinatorics"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00453-008-9182-2","volume":"53","author":"S. Bereg","year":"2009","unstructured":"Bereg, S., D\u0103escu, O., Jiang, M.: A PTAS for cutting out polygons with lines. Algorithmica\u00a053, 157\u2013171 (2009)","journal-title":"Algorithmica"},{"key":"25_CR4","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":"25_CR5","unstructured":"Chandrasekaran, R., D\u0103escu, O., Luo, J.: Cutting out polygons. In: Proceedings of the Canadian Conference on Computational Geometry, pp. 183\u2013186 (2005)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1142\/S0218195906002014","volume":"16","author":"O. D\u0103escu","year":"2006","unstructured":"D\u0103escu, O., Luo, J.: Cutting out polygons with lines and rays. International Journal of Computational Geometry and Applications\u00a016, 227\u2013248 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"25_CR7","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":"25_CR8","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 cutting out convex polygons. Computational Geometry: Theory and Applications\u00a029, 223\u2013231 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"25_CR9","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, 353\u2013358 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D.T. Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks\u00a014(3), 393\u2013410 (1984)","journal-title":"Networks"},{"key":"25_CR12","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, pp. 316\u2013321 (1985)","DOI":"10.1145\/323233.323274"},{"key":"25_CR13","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","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T02:11:16Z","timestamp":1560996676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}