{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:45Z","timestamp":1725892605066},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"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-21204-8_16","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"125-135","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]},{"given":"Gangshan","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-11440-3_9","volume-title":"WALCOM: Algorithms and Computation","author":"S.I. Ahmed","year":"2010","unstructured":"Ahmed, S.I., Hasan, M., Islam, M.A.: Cutting a convex polyhedron out of a sphere. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 94\u2013101. Springer, Heidelberg (2010)"},{"key":"16_CR2","doi-asserted-by":"publisher","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\u00a053, 157\u2013171 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"16_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 sequence. European Journal of Operational Research\u00a088(1), 69\u201387 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"2-3","key":"16_CR4","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 & Applications\u00a016(2-3), 227\u2013248 (2006)","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"3","key":"16_CR5","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(3), 223\u2013231 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0925-7721(97)00004-7","volume":"10","author":"J. Hershberger","year":"1998","unstructured":"Hershberger, J., Suri, S.: Practical methods for approximating shortest paths on a convex polytope in R 3. Computational Geometry: Theory and Applications\u00a010, 31\u201346 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math.\u00a036, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"16_CR8","doi-asserted-by":"publisher","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 Applications\u00a025, 67\u201395 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: Proc. of the 1st Annual ACM Symposium on Computational Geometry, Maryland, USA, pp. 316\u2013321 (1985)","DOI":"10.1145\/323233.323274"},{"key":"16_CR10","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","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T08:10:43Z","timestamp":1560240643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}