{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:18:52Z","timestamp":1725815932499},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_6","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"58-68","source":"Crossref","is-referenced-by-count":0,"title":["On Collections of Polygons Cuttable with a Segment Saw"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Anirban","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Masud","family":"Hasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_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., Islam, M.A., Hasan, M.: Cutting a cornered convex polygon out of a circle. Journal of Computers\u00a05(1), 4\u201311 (2010)","journal-title":"Journal of Computers"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02187724","volume":"4","author":"N. Alon","year":"1989","unstructured":"Alon, N., Katchalski, M., Pulleyblank, W.R.: Cutting disjoint disks by straight lines. Discrete & Computational Geometry\u00a04, 239\u2013243 (1989)","journal-title":"Discrete & Computational Geometry"},{"key":"6_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"},{"issue":"8","key":"6_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1142\/S0218195908002684","volume":"15","author":"S. Bereg","year":"2008","unstructured":"Bereg, S., Dumitrescu, A., Pach, J.: Sliding disks in the plane. International Journal of Computational Geometry & Applications\u00a015(8), 373\u2013387 (2008)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"6_CR5","unstructured":"de Bruijn, N.G.: Aufgaben 17 and 18 (in Dutch). Nieuw Archief voor Wiskunde 2, 67 (1954)"},{"key":"6_CR6","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":"6_CR7","unstructured":"Chandrasekaran, R., D\u0103escu, O., Luo, J.: Cutting out polygons, In. In: Proceedings of the 17th Canadian Conference on Computational Geometry, pp. 183\u2013186 (2005)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02187835","volume":"7","author":"J. Czyzowicz","year":"1992","unstructured":"Czyzowicz, J., Rivera-Campo, E., Urrutia, J.: Separating convex sets in the plane. Discrete & Computational Geometry\u00a07, 189\u2013195 (1992)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0166-218X(94)90030-2","volume":"51","author":"J. Czyzowicz","year":"1994","unstructured":"Czyzowicz, J., Rivera-Campo, E., Urrutia, J.: Separation of convex sets. Discrete Applied Mathematics\u00a051(3), 325\u2013328 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR10","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":"6_CR11","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":"6_CR12","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":"6_CR13","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"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0218195913600030","volume":"23","author":"A. Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Hasan, M.: Cutting out polygons with a circular saw. International Journal of Computational Geometry and Applications\u00a023(2), 127\u2013139 (2013)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.comgeo.2012.06.001","volume":"46","author":"A. Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Jiang, M.: On reconfiguration of disks in the plane and other related problems. Computational Geometry: Theory and Applications\u00a046(3), 191\u2013202 (2013)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"6_CR16","first-page":"119","volume":"15","author":"L. Fejes T\u00f3th","year":"1963","unstructured":"Fejes T\u00f3th, L., Heppes, A.: \u00dcber stabile K\u00f6rpersysteme (in German). Compositio Mathematica\u00a015, 119\u2013126 (1963)","journal-title":"Compositio Mathematica"},{"key":"6_CR17","series-title":"Advances in Computing Research","first-page":"61","volume-title":"Computational Geometry","author":"L. Guibas","year":"1983","unstructured":"Guibas, L., Yao, F.F.: On translating a set of rectangles. In: Computational Geometry. Advances in Computing Research, vol.\u00a01, pp. 61\u201367. JAI Press, London (1983)"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.7146\/math.scand.a-12291","volume":"66","author":"K. Hope","year":"1990","unstructured":"Hope, K., Katchalski, M.: Separating plane convex sets. Math. Scand.\u00a066, 44\u201346 (1990)","journal-title":"Math. Scand."},{"key":"6_CR19","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press (1998)"},{"key":"6_CR20","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":"6_CR21","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s004540010050","volume":"24","author":"J. Pach","year":"2000","unstructured":"Pach, J., Tardos, G.: Cutting glass. Discrete & Computational Geometry\u00a024, 481\u2013495 (2000)","journal-title":"Discrete & Computational Geometry"},{"issue":"1-3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0012-365X(01)00128-5","volume":"241","author":"J. Pach","year":"2001","unstructured":"Pach, J., Tardos, G.: Separating convex sets by straight lines. Discrete Mathematics\u00a0241(1-3), 427\u2013433 (2001)","journal-title":"Discrete Mathematics"},{"key":"6_CR23","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 Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T05:27:21Z","timestamp":1566278841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}