{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:16Z","timestamp":1725880576952},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_6","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"66-77","source":"Crossref","is-referenced-by-count":0,"title":["Bundling Two Simple Polygons to Minimize Their Convex Hull"],"prefix":"10.1007","author":[{"given":"Jongmin","family":"Choi","sequence":"first","affiliation":[]},{"given":"Dongwoo","family":"Park","sequence":"additional","affiliation":[]},{"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/s00453-010-9466-1","volume":"62","author":"HK Ahn","year":"2012","unstructured":"Ahn, H.K., Cheong, O.: Aligning two convex figures to minimize area or perimeter. Algorithmica 62, 464\u2013479 (2012)","journal-title":"Algorithmica"},{"key":"6_CR2","unstructured":"Ahn, H.K., Abardia, J., Bae, S.W., Cheong, O., Dann, S., Park, D., Shin, C.S.: The minimum convex container of two convex polytopes under translations, submitted manuscript"},{"key":"6_CR3","unstructured":"Ahn, H.K., Bae, S.W., Cheong, O., Park, D., Shin, C.S.: Minimum convex container of two convex polytopes under translations. In: Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG 2014) (2014)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.comgeo.2007.08.001","volume":"40","author":"HK Ahn","year":"2008","unstructured":"Ahn, H.K., Brass, P., Shin, C.S.: Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. 40(2), 171\u2013177 (2008). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925772107000909","journal-title":"Comput. Geom."},{"key":"6_CR5","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. 2098, pp. 67\u201380. Springer, Heidelberg (2001). doi: 10.1007\/3-540-47738-1_5"},{"key":"6_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geomtry, Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geomtry, Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"key":"6_CR7","doi-asserted-by":"crossref","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 19, 148\u2013182 (1997)","journal-title":"Algorithmica"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L., Ramshaw, L., Stolfi, J.: A kinetic framework for computational geometry. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS 1983), pp. 100\u2013111. IEEE (1983)","DOI":"10.1109\/SFCS.1983.1"},{"key":"6_CR9","unstructured":"Kaul, A., O\u2019Connor, M.A., Srinivasan, V.: Computing Minkowski sums of regular polygons. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp. 74\u201377 (1991)"},{"key":"6_CR10","unstructured":"Kepler, J.: Vom sechseckigen Schnee, Ostwalds Klassiker der Exakten Wissenschaften, vol. 273. Akademische Verlagsgesellschaft Geest & Portig K.-G., Leipzig, strena seu de Nive sexangula, Translated from the Latin and with an introduction and notes by Dorothea Goetz (1987)"},{"issue":"4","key":"6_CR11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1080\/07408178808966189","volume":"20","author":"HC Lee","year":"1988","unstructured":"Lee, H.C., Woo, T.C.: Determining in linear time the minimum area convex hull of two polygons. IIE Trans. 20(4), 338\u2013345 (1988)","journal-title":"IIE Trans."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(99)00006-1","volume":"13","author":"V Milenkovic","year":"1999","unstructured":"Milenkovic, V.: Rotational polygon containment and minimum enclosure using robust 2D constructions. Comput. Geom.: Theory Appl. 13, 3\u201319 (1999)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Ramkumar, G.: An algorithm to compute the Minkowski sum outer-face of two simple polygons. In: Proceedings of the 12th Annual Symposium on Computational Geometry (SoCG 1996), pp. 234\u2013241. ACM (1996)","DOI":"10.1145\/237218.237374"},{"key":"6_CR14","doi-asserted-by":"crossref","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. Jpn. J. Ind. Appl. Math. 21, 259\u2013278 (2004)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"1","key":"6_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1142\/S0218195906001926","volume":"16","author":"K Tang","year":"2006","unstructured":"Tang, K., Wang, C.C.L., Chen, D.Z.: Minimum area convex packing of two convex polygons. Int. J. Comput. Geom. Appl. 16(1), 41\u201374 (2006)","journal-title":"Int. J. Comput. Geom. Appl."}],"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-319-53925-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T13:53:06Z","timestamp":1601646786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}