{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:26:07Z","timestamp":1760441167827},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_2","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"13-24","source":"Crossref","is-referenced-by-count":1,"title":["Bundling Three Convex Polygons to Minimize Area or Perimeter"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Alt","sequence":"additional","affiliation":[]},{"given":"Sang Won","family":"Bae","sequence":"additional","affiliation":[]},{"given":"Dongwoo","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1007\/11602613_88","volume-title":"Algorithms and Computation","author":"H.-K. Ahn","year":"2005","unstructured":"Ahn, H.-K., Cheong, O.: Stacking and bundling two convex polygons. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 882\u2013891. Springer, Heidelberg (2005)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/s00453-010-9466-1","volume":"62","author":"H.K. Ahn","year":"2012","unstructured":"Ahn, H.K., Cheong, O.: Aligning two convex figures to minimize area or perimeter. Algorithmica\u00a062, 464\u2013479 (2012)","journal-title":"Algorithmica"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-47738-1_5","volume-title":"Discrete and Computational Geometry","author":"H. Alt","year":"2001","unstructured":"Alt, H., Hurtado, F.: Packing convex polygons into rectangular boxes. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol.\u00a02098, pp. 67\u201380. Springer, Heidelberg (2001)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/PL00014415","volume":"19","author":"K. Daniels","year":"1997","unstructured":"Daniels, K., Milenkovic, V.: Multiple translational containment, part i: An approximation algorithm. Algorithmica\u00a019, 148\u2013182 (1997)","journal-title":"Algorithmica"},{"key":"2_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1080\/07408178808966189","volume":"20","author":"H. Lee","year":"1988","unstructured":"Lee, H., Woo, T.: Determining in linear time the minimum area convex hull of two polygons. IIE Trans.\u00a020, 338\u2013345 (1988)","journal-title":"IIE Trans."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Milenkovic, V.: Translational polygon containment and minimum enclosure using linear programming based restriction. In: Proc. 28th Annual ACM Symposium on Theory of Computation (STOC 1996), pp. 109\u2013118 (1996)","DOI":"10.1145\/237814.237840"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF03167582","volume":"21","author":"K. Sugihara","year":"2004","unstructured":"Sugihara, K., Sawai, M., Sano, H., Kim, D.S., Kim, D.: Disk packing for the estimation of the size of a wire bundle. Japan J. Industrial and Applied Math.\u00a021, 259\u2013278 (2004)","journal-title":"Japan J. Industrial and Applied Math."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0218195906001926","volume":"16","author":"K. Tang","year":"2006","unstructured":"Tang, K., Wang, C., Chen, D.: Minimum area convex packing of two convex polygons. Internat. J. Comput. Geom. Appl.\u00a016, 41\u201374 (2006)","journal-title":"Internat. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:27:31Z","timestamp":1557944851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}