{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T11:47:25Z","timestamp":1784548045649,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662483497","type":"print"},{"value":"9783662483503","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_3","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"25-34","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-40104-6_2","volume-title":"Algorithms and Data Structures","author":"H.-K. Ahn","year":"2013","unstructured":"Ahn, H.-K., Alt, H., Bae, S.W., Park, D.: Bundling Three Convex Polygons to Minimize Area or Perimeter. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol.\u00a08037, pp. 13\u201324. Springer, Heidelberg (2013)"},{"issue":"1-2","key":"3_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(1-2), 464\u2013479 (2012)","journal-title":"Algorithmica"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Alt, H., Hurtado, F.: Packing convex polygons into rectangular boxes. In: JCDCG, pp. 67\u201380 (2000)","DOI":"10.1007\/3-540-47738-1_5"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inf. Process. Lett.\u00a012(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.comgeo.2013.08.008","volume":"47","author":"R. Harren","year":"2014","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A (5\/3 + \u03b5)-approximation for strip packing. Comput. Geom.\u00a047(2), 248\u2013267 (2014)","journal-title":"Comput. Geom."},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in o(n log n) time. Inf. Process. Lett.\u00a033(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1080\/07408178808966189","volume":"20","author":"H.-C. Lee","year":"1988","unstructured":"Lee, H.-C., Woo, T.C.: Determining in linear time the minimum area convex hull of two polygons. IIE Transactions\u00a020(4), 338\u2013345 (1988)","journal-title":"IIE Transactions"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Milenkovic, V.: Translational polygon containment and minimal enclosure using linear programming based restriction. In: STOC, pp. 109\u2013118 (1996)","DOI":"10.1145\/237814.237840"},{"issue":"1\/2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/PL00014416","volume":"19","author":"V. Milenkovic","year":"1997","unstructured":"Milenkovic, V.: Multiple translational containment. part ii: Exact algorithms. Algorithmica\u00a019(1\/2), 183\u2013218 (1997)","journal-title":"Algorithmica"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Milenkovic, V.: Rotational polygon containment and minimum enclosure. In: Symposium on Computational Geometry, pp. 1\u20138 (1998)","DOI":"10.1145\/276884.276885"},{"key":"3_CR11","unstructured":"Scheithauer, G.: Zuschnitt- und Packungsoptimierung: Problemstellungen, Modellierungstechniken, L\u00f6sungsmethoden. Studienb\u00fccher Wirtschaftsmathematik. Vieweg+Teubner Verlag (2008)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA \u201994","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM J. Comput.\u00a026(2), 401\u2013409 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","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. Geometry Appl.\u00a016(1), 41\u201374 (2006)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"3_CR15","unstructured":"von Niederh\u00e4usern, L.: Packing polygons. Master\u2019s thesis, EPFL Lausanne, FU Berlin (2014)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:06:23Z","timestamp":1559246783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}