{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:48Z","timestamp":1759637808127},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T00:00:00Z","timestamp":1300320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00373-011-1018-1","type":"journal-article","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T05:25:04Z","timestamp":1300253104000},"page":"307-319","source":"Crossref","is-referenced-by-count":3,"title":["Cutting a Convex Polyhedron Out of a Sphere"],"prefix":"10.1007","volume":"27","author":[{"given":"Syed Ishtiaque","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masud","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Ariful","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"key":"1018_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, S.I., Bhuiyan, M.M.A., Hasan, M., Khan, I.K.: On finding a better position of a convex polygon inside a circle to minimize the cutting cost. In: Proceedings of WALCOM\u201910, vol. 5942, LNCS, pp. 252\u2013262. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11440-3_23"},{"issue":"1","key":"1018_CR2","doi-asserted-by":"crossref","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. J. Comput. 5(1), 4\u201311 (2010)","journal-title":"J. Comput."},{"key":"1018_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00453-008-9182-2","volume":"53","author":"S. Bereg","year":"2009","unstructured":"Bereg S., Daescu O., Jiang M.: A PTAS for cutting out polygons with lines. Algorithmica 53, 157\u2013171 (2009)","journal-title":"Algorithmica"},{"key":"1018_CR4","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 88, 69\u201387 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"1018_CR5","doi-asserted-by":"crossref","unstructured":"Biedl, T.C., Hasan, M., L\u00f3pez-Ortiz, A.: Efficient view point selection for silhouette of convex polyhedra. In: Proceedings of MFCS\u201904, vol. 3153, LNCS, pp. 735\u2013747. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-28629-5_57"},{"key":"1018_CR6","unstructured":"Chandrasekaran, R., Daescu, O., Luo, J.: Cutting out polygons. In: Proceedings of CCCG\u201905, pp. 183\u2013186 (2005)"},{"key":"1018_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1142\/S0218195906002014","volume":"16","author":"O. Daescu","year":"2006","unstructured":"Daescu O., Luo J.: Cutting out polygons with lines and rays. Int. J. Comput. Geom. Appl. 16, 227\u2013248 (2006)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"1018_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg M., van Kreveld M., Overmars M., Schwarzkopf O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"1018_CR9","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. Comput. Geom. Theory Appl. 20, 69\u201384 (2001)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1018_CR10","doi-asserted-by":"crossref","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. Comput. Geom. Theory Appl. 29, 223\u2013231 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1018_CR11","doi-asserted-by":"crossref","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. Discret. Appl. Math. 143, 353\u2013358 (2004)","journal-title":"Discret. Appl. Math."},{"key":"1018_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0925-7721(02)00131-1","volume":"25","author":"J.W. Jaromczyk","year":"2003","unstructured":"Jaromczyk J.W., Kowaluk M.: Sets of lines and cutting out polyhedral objects. Comput. Geom. Theory Appl. 25, 67\u201395 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"1018_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00991005","volume":"14","author":"J. O\u2019Rourke","year":"1985","unstructured":"O\u2019Rourke J.: Finding minimal enclosing boxes. Int. J. Comput. Inform. Sci. 14(3), 183\u2013199 (1985)","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"1018_CR14","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: Proceedings of SoCG\u201985, pp. 316\u2013321 (1985)","DOI":"10.1145\/323233.323274"},{"key":"1018_CR15","doi-asserted-by":"crossref","unstructured":"Tan, X.: Approximation algorithms for cutting out polygons with lines and rays. In: Proceedings of COCOON\u201905, vol. 3595, LNCS, pp. 534\u2013543. Springer, Berlin (2005)","DOI":"10.1007\/11533719_54"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1018-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1018-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1018-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T08:15:04Z","timestamp":1560068104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1018-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,17]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["1018"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1018-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,17]]}}}