{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:22Z","timestamp":1725544042432},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_9","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"94-101","source":"Crossref","is-referenced-by-count":1,"title":["Cutting a Convex Polyhedron Out of a Sphere"],"prefix":"10.1007","author":[{"given":"Syed Ishtiaque","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Masud","family":"Hasan","sequence":"additional","affiliation":[]},{"given":"Md. Ariful","family":"Islam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Ahmed, S.I., Hasan, M., Islam, M.A.: Cutting a cornered convex polygon out of a circle. Journal of Computers (to appear), http:\/\/203.208.166.84\/masudhasan\/cut.pdf"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/11809678_20","volume-title":"Computing and Combinatorics","author":"S. Bereg","year":"2006","unstructured":"Bereg, S., Daescu, O., Jiang, M.: A PTAS for cutting out polygons with lines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 176\u2013185. Springer, Heidelberg (2006)"},{"key":"9_CR3","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. Euro. J. Oper. Res.\u00a088, 69\u201387 (1996)","journal-title":"Euro. J. Oper. Res."},{"key":"9_CR4","unstructured":"Chandrasekaran, R., Daescu, O., Luo, J.: Cutting out polygons. In: CCCG 2005, pp. 183\u2013186 (2005)"},{"key":"9_CR5","doi-asserted-by":"publisher","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. International Journal of Computational Geometry and Applications\u00a016, 227\u2013248 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"9_CR6","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, Heidelberg (2000)","edition":"2"},{"key":"9_CR7","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 Algorithms\u00a020, 69\u201384 (2001)","journal-title":"Computational Geometry: Theory and Algorithms"},{"key":"9_CR8","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. Computational Geometry: Theory and Algorithms\u00a029, 223\u2013231 (2004)","journal-title":"Computational Geometry: Theory and Algorithms"},{"key":"9_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":"9_CR10","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. Computational Geometry: Theory and Algorithms\u00a025, 67\u201395 (2003)","journal-title":"Computational Geometry: Theory and Algorithms"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF00991005","volume":"14","author":"J. O\u2019Rourke","year":"1985","unstructured":"O\u2019Rourke, J.: Finding minimal enclosing boxes. International Journal of Computer and Information Sciences\u00a014(3), 183\u2013199 (1985)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: SoCG 1985, pp. 316\u2013321 (1985)","DOI":"10.1145\/323233.323274"},{"key":"9_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)"},{"key":"9_CR14","unstructured":"Toussaint, G.: Solving geometric problems with the rotating calipers. In: MELECON 1983, Athens, Greece (1983)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:38Z","timestamp":1606185638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}