{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:34Z","timestamp":1759638934189},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T00:00:00Z","timestamp":1376438400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00224-013-9493-9","type":"journal-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T00:42:45Z","timestamp":1376354565000},"page":"689-714","source":"Crossref","is-referenced-by-count":1,"title":["Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing"],"prefix":"10.1007","volume":"54","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther M.","family":"Arkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Efrat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Hart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Kostitsyna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Kr\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,14]]},"reference":[{"key":"9493_CR1","unstructured":"See http:\/\/en.wikipedia.org\/wiki\/Ginger_biscuit"},{"key":"9493_CR2","unstructured":"See http:\/\/www.annasthins.ca\/"},{"key":"9493_CR3","unstructured":"See http:\/\/en.wikipedia.org\/wiki\/Cat_flap"},{"key":"9493_CR4","unstructured":"See http:\/\/pack-any-shape.com\/"},{"issue":"4","key":"9493_CR5","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"9493_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/B978-044482537-7\/50002-4","volume-title":"Handbook of Computational Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 1\u201347. Elsevier Science\/North-Holland, Amsterdam (2000)"},{"key":"9493_CR7","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theoretical Informatics\u201410th Latin American Symposium (LATIN 2012)","author":"H.-K. Ahn","year":"2012","unstructured":"Ahn, H.-K., Bae, S.W., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A.: A generalization of the convex Kakeya problem. In: Fern\u00e1ndez-Baca, D. (ed.) Theoretical Informatics\u201410th Latin American Symposium (LATIN 2012), Arequipa, Peru, April 16\u201320, 2012. Lecture Notes in Computer Science, vol. 7256, pp. 1\u201312. Springer, Berlin (2012)"},{"issue":"2","key":"9493_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.comgeo.2007.08.001","volume":"40","author":"H.-K. 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., Theory Appl. 40(2), 171\u2013177 (2008)","journal-title":"Comput. Geom., Theory Appl."},{"issue":"5","key":"9493_CR9","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.comgeo.2011.11.003","volume":"46","author":"H.-K. Ahn","year":"2013","unstructured":"Ahn, H.-K., Cheng, S.-W., Reinbacher, I.: Maximum overlap of convex polytopes under translation. Comput. Geom., Theory Appl. 46(5), 552\u2013565 (2013)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9493_CR10","volume-title":"Algorithms and Computation, 16th International Symposium (ISAAC 2005)","author":"H.-K. Ahn","year":"2005","unstructured":"Ahn, H.-K., Cheong, O.: Stacking and bundling two convex polygons. In: Algorithms and Computation, 16th International Symposium (ISAAC 2005), Sanya, Hainan, China, December 19\u201321 (2005)"},{"issue":"1\u20132","key":"9493_CR11","doi-asserted-by":"crossref","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 62(1\u20132), 464\u2013479 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"9493_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.comgeo.2006.01.005","volume":"37","author":"H.-K. Ahn","year":"2007","unstructured":"Ahn, H.-K., Cheong, O., Park, C.-D., Shin, C.-S., Vigneron, A.: Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom., Theory Appl. 37(1), 3\u201315 (2007)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9493_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/BFb0032068","volume-title":"Proc. Automata, Languages and Programming, 17th International Colloquium (ICALP 1990)","author":"H. Alt","year":"1990","unstructured":"Alt, H., Bl\u00f6mer, J., Wagener, H.: Approximation of convex polygons. In: Paterson, M. (ed.) Proc. Automata, Languages and Programming, 17th International Colloquium (ICALP 1990), Warwick University, England, July 16\u201320, 1990. Lecture Notes in Computer Science, vol. 443, pp. 703\u2013716. Springer, Berlin (1990)"},{"issue":"1","key":"9493_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/PL00009210","volume":"21","author":"H. Alt","year":"1998","unstructured":"Alt, H., Fuchs, U., Rote, G., Weber, G.: Matching convex shapes with respect to the symmetric difference. Algorithmica 21(1), 89\u2013103 (1998)","journal-title":"Algorithmica"},{"key":"9493_CR15","series-title":"Lecture Notes in Computer Science","first-page":"67","volume-title":"Discrete and Computational Geometry","author":"H. Alt","year":"2000","unstructured":"Alt, H., Hurtado, F.: Packing convex polygons into rectangular boxes. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22\u201325 Lecture Notes in Computer Science, vol. 2098, pp. 67\u201380. Springer, Berlin (2000). Revised Papers"},{"key":"9493_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/98524.98575","volume-title":"Proc. 6th Annual Symposium on Computational Geometry","author":"H. Aonuma","year":"1990","unstructured":"Aonuma, H., Imai, H., Imai, K., Tokuyama, T.: Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams. In: Proc. 6th Annual Symposium on Computational Geometry, pp. 225\u2013234. ACM, New York (1990)"},{"key":"9493_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-642-30347-0_5","volume-title":"Proc. Fun with Algorithms\u20146th International Conference","author":"E.M. Arkin","year":"2012","unstructured":"Arkin, E.M., Efrat, A., Hart, G., Kostitsyna, I., Kr\u00f6ller, A., Mitchell, J.S.B., Polishchuk, V.: Scandinavian thins on top of cake: on the smallest one-size-fits-all box. In: Kranakis, E., Krizanc, D., Luccio, F.L. (eds.) Proc. Fun with Algorithms\u20146th International Conference, FUN 2012, Venice, Italy, June 4\u20136, 2012. Lecture Notes in Computer Science, vol. 7288, pp. 16\u201327. Springer, Berlin (2012)"},{"key":"9493_CR18","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF01769706","volume":"10","author":"E.M. Arkin","year":"1993","unstructured":"Arkin, E.M., Khuller, S., Mitchell, J.S.B.: Geometric knapsack problems. Algorithmica 10, 399\u2013427 (1993)","journal-title":"Algorithmica"},{"key":"9493_CR19","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/41958.41984","volume-title":"Proc. 3rd Annual Symposium on Computional Geometry","author":"F. Avnaim","year":"1987","unstructured":"Avnaim, F., Boissonnat, J.-D.: Simultaneous containment of several polygons. In: Proc. 3rd Annual Symposium on Computional Geometry, pp. 242\u2013250 (1987)"},{"key":"9493_CR20","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1016\/0196-6774(86)90017-9","volume":"7","author":"B.S. Baker","year":"1986","unstructured":"Baker, B.S., Fortune, S.J., Mahaney, S.R.: Polygon containment under translation. J. Algorithms 7, 532\u2013548 (1986)","journal-title":"J. Algorithms"},{"key":"9493_CR21","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1142\/S0218195901000596","volume":"11","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Polygon containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard. Int. J. Comput. Geom. Appl. 11, 465\u2013474 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"9493_CR22","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1006\/jagm.1996.0057","volume":"21","author":"B. Becker","year":"1996","unstructured":"Becker, B., Franciosa, P.G., Gschwind, S., Leonardi, S., Ohler, T., Widmayer, P.: Enclosing a set of objects by two minimum area rectangles. J. Algorithms 21(3), 520\u2013541 (1996)","journal-title":"J. Algorithms"},{"key":"9493_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-540-44400-8_9","volume-title":"JCDCG\u201902","author":"B.K. Bhattacharya","year":"2003","unstructured":"Bhattacharya, B.K., Mukhopadhyay, A.: On the minimum perimeter triangle enclosing a convex polygon. In: Akiyama, J., Kano, M. (eds.) JCDCG\u201902. Lecture Notes in Computer Science, vol. 2866, pp. 84\u201396. Springer, Berlin (2003)"},{"issue":"1","key":"9493_CR24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1142\/S0218195911003536","volume":"21","author":"P. Bose","year":"2011","unstructured":"Bose, P., Mora, M., Seara, C., Sethia, S.: On computing enclosing isosceles triangles and related problems. Int. J. Comput. Geom. Appl. 21(1), 25\u201345 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9493_CR25","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0214011","volume":"14","author":"J.E. Boyce","year":"1985","unstructured":"Boyce, J.E., Dobkin, D.P., Drysdale, R.L. III, Guibas, L.J.: Finding extremal polygons. SIAM J. Comput. 14, 134\u2013147 (1985)","journal-title":"SIAM J. Comput."},{"key":"9493_CR26","series-title":"LNCS","first-page":"259","volume-title":"COCOON 2004","author":"P. Brass","year":"2004","unstructured":"Brass, P., Cheong, O., Na, H.S., Shin, C.S., Vigneron, A.: Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon. In: COCOON 2004. LNCS, vol. 3106, pp. 259\u2013267. Springer, Berlin (2004)"},{"issue":"6","key":"9493_CR27","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1142\/S0218195909003118","volume":"19","author":"S. Cabello","year":"2009","unstructured":"Cabello, S., de Berg, M., Giannopoulos, P., Knauer, C., van Oostrum, R., Veltkamp, R.C.: Maximizing the area of overlap of two unions of disks under rigid motion. Int. J. Comput. Geom. Appl. 19(6), 533\u2013556 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1\u20132","key":"9493_CR28","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"T.M. Chan","year":"2006","unstructured":"Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom., Theory Appl. 35(1\u20132), 20\u201335 (2006)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9493_CR29","unstructured":"Chang, J.S.: Polygon optimization problems. Report 240. CS, NYU, New York (1986)"},{"key":"9493_CR30","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02187692","volume":"1","author":"J.S. Chang","year":"1986","unstructured":"Chang, J.S., Yap, C.K.: A polynomial solution for the potato-peeling problem. Discrete Comput. Geom. 1, 155\u2013182 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9493_CR31","first-page":"1","volume":"1","author":"B.M. Chazelle","year":"1983","unstructured":"Chazelle, B.M.: The polygon containment problem. Adv. Comput. Res. 1, 1\u201333 (1983)","journal-title":"Adv. Comput. Res."},{"issue":"1\u20132","key":"9493_CR32","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/PL00014415","volume":"19","author":"K. Daniels","year":"1997","unstructured":"Daniels, K., Milenkovic, V.J.: Multiple translational containment, Part I: An approximate algorithm. Algorithmica 19(1\u20132), 148\u2013182 (1997)","journal-title":"Algorithmica"},{"issue":"5","key":"9493_CR33","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/PL00005845","volume":"31","author":"M. Berg de","year":"1998","unstructured":"de Berg, M., Cheong, O., Devillers, O., van Kreveld, M.J., Teillaud, M.: Computing the maximum overlap of two convex polygons under translations. Theory Comput. Syst. 31(5), 613\u2013628 (1998)","journal-title":"Theory Comput. Syst."},{"key":"9493_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)"},{"key":"9493_CR35","unstructured":"DePano, N.A.A.: Polygon approximation with optimized polygonal enclosures: applications and algorithms. Ph.D. thesis, Department of Computer Science, Johns Hopkins University (1987)"},{"key":"9493_CR36","first-page":"81","volume-title":"Procedings of the 22nd Allerton Conference on Communication, Control, and Computing","author":"N.A.A. DePano","year":"1984","unstructured":"DePano, N.A.A., Aggarwal, A.: Finding restricted k-envelopes for convex polygons. In: Procedings of the 22nd Allerton Conference on Communication, Control, and Computing, pp. 81\u201390 (1984)"},{"issue":"4","key":"9493_CR37","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.comgeo.2008.06.003","volume":"42","author":"J. Egeblad","year":"2009","unstructured":"Egeblad, J., Nielsen, B.K., Brazil, M.: Translational packing of arbitrary polytopes. Comput. Geom., Theory Appl. 42(4), 269\u2013288 (2009)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9493_CR38","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360881.360919","volume":"18","author":"H. Freeman","year":"1975","unstructured":"Freeman, H., Shapira, R.: Determining the minimum-area encasing rectangle for an arbitrary closed curve. Commun. ACM 18, 409\u2013413 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"9493_CR39","first-page":"37","volume":"3","author":"K. Fukuda","year":"2007","unstructured":"Fukuda, K., Uno, T.: Polynomial time algorithms for maximizing the intersection volume of polytopes. Pac. J. Optim. 3(1), 37\u201352 (2007)","journal-title":"Pac. J. Optim."},{"issue":"1\u20133","key":"9493_CR40","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0012-365X(97)00050-2","volume":"181","author":"R.L. Graham","year":"1998","unstructured":"Graham, R.L., Lubachevsky, B.D., Nurmela, K.J., \u00d6sterg\u00e5rd, P.R.J.: Dense packings of congruent circles in a circle. Discrete Math. 181(1\u20133), 139\u2013154 (1998)","journal-title":"Discrete Math."},{"issue":"3","key":"9493_CR41","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0377-2217(97)00049-0","volume":"108","author":"R. Heckmann","year":"1998","unstructured":"Heckmann, R., Lengauer, T.: Computing upper and lower bounds on textile nesting problems. Eur. J. Oper. Res. 108(3), 473\u2013489 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9493_CR42","doi-asserted-by":"crossref","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(nlogn) time. Inf. Process. Lett. 33(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9493_CR43","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.J.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom., Theory Appl. 43(4), 419\u2013433 (2010)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9493_CR44","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-642-61542-9_20","volume-title":"Theory and Practice of Geometric Modeling","author":"R.R. Martin","year":"1989","unstructured":"Martin, R.R., Stephenson, P.C.: Containment algorithms for objects in rectangular boxes. In: Theory and Practice of Geometric Modeling, pp. 307\u2013325. Springer, Berlin (1989)"},{"key":"9493_CR45","unstructured":"Mattila, A.-L.: Piparikirja. Atena, Jyv\u00e4skyl\u00e4 (2001). In Finnish"},{"key":"9493_CR46","first-page":"25","volume-title":"Proc. Canadian Conference on Computational Geometry (CCCG 2003)","author":"A. Medvedeva","year":"2003","unstructured":"Medvedeva, A., Mukhopadhyay, A.: An implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. In: Proc. Canadian Conference on Computational Geometry (CCCG 2003), pp. 25\u201328 (2003)"},{"key":"9493_CR47","first-page":"109","volume-title":"Proc. 28th Annual ACM Symposum on the Theory of Computing","author":"V. Milenkovic","year":"1996","unstructured":"Milenkovic, V.: Translational polygon containment and minimal enclosure using linear programming based restriction. In: Proc. 28th Annual ACM Symposum on the Theory of Computing, pp. 109\u2013118 (1996)"},{"issue":"1","key":"9493_CR48","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 only robust 2d constructions. Comput. Geom., Theory Appl. 13(1), 3\u201319 (1999)","journal-title":"Comput. Geom., Theory Appl."},{"issue":"3\u20134","key":"9493_CR49","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ipl.2008.02.007","volume":"107","author":"J.S.B. Mitchell","year":"2008","unstructured":"Mitchell, J.S.B., Polishchuk, V.: Minimum-perimeter enclosing k-gon. Inf. Process. Lett. 107(3\u20134), 120\u2013124 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9493_CR50","doi-asserted-by":"crossref","unstructured":"Mount, D.M., Silverman, R.: Minimum enclosures with specified angles. Technical Report CS-3219, University of Maryland, (1994)","DOI":"10.1117\/12.142158"},{"issue":"1","key":"9493_CR51","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/cviu.1996.0045","volume":"64","author":"D.M. Mount","year":"1996","unstructured":"Mount, D.M., Silverman, R., Wu, A.Y.: On the area of overlap of translated polygons. Comput. Vis. Image Underst. 64(1), 53\u201361 (1996)","journal-title":"Comput. Vis. Image Underst."},{"issue":"3","key":"9493_CR52","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/PL00009472","volume":"22","author":"K.J. Nurmela","year":"1999","unstructured":"Nurmela, K.J., \u00d6sterg\u00e5rd, P.R.J.: More optimal packings of equal circles in a square. Discrete Comput. Geom. 22(3), 439\u2013457 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9493_CR53","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00991005","volume":"14","author":"J. O\u2019Rourke","year":"1985","unstructured":"O\u2019Rourke, J.: Finding minimal enclosing boxes. Int. J. Comput. Inf. Sci. 14, 183\u2013199 (1985)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"9493_CR54","unstructured":"Pirzadeh, H.: Computational geometry with the rotating calipers. Master\u2019s thesis, McGill U (1999)"},{"key":"9493_CR55","first-page":"C34","volume-title":"Proc. 11th Annual Symposium on Computational Geometry","author":"C. Schwarz","year":"1995","unstructured":"Schwarz, C., Teich, J., Vainshtein, A., Welzl, E., Evans, B.L.: Minimal enclosing parallelogram with application. In: Proc. 11th Annual Symposium on Computational Geometry, pp. C34\u2013C35 (1995)"},{"issue":"5","key":"9493_CR56","doi-asserted-by":"crossref","first-page":"424","DOI":"10.4169\/amer.math.monthly.118.05.424","volume":"118","author":"M. Skopenkov","year":"2011","unstructured":"Skopenkov, M.: Packing a cake into a box. Am. Math. Mon. 118(5), 424\u2013433 (2011)","journal-title":"Am. Math. Mon."},{"key":"9493_CR57","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."},{"key":"9493_CR58","first-page":"176","volume-title":"SoCG \u201991","author":"S. Toledo","year":"1991","unstructured":"Toledo, S.: Extremal polygon containment problems. In: SoCG \u201991, pp. 176\u2013185. ACM, New York (1991)"},{"key":"9493_CR59","first-page":"1","volume-title":"Proceedngs of IEEE MELECON \u201983","author":"G.T. Toussaint","year":"1983","unstructured":"Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedngs of IEEE MELECON \u201983, pp. 1\u20134 (1983)"},{"issue":"4","key":"9493_CR60","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.jda.2008.04.002","volume":"6","author":"M.J. Kreveld van","year":"2008","unstructured":"van Kreveld, M.J., L\u00f6ffler, M.: Approximating largest convex hulls for imprecise points. J. Discrete Algorithms 6(4), 583\u2013594 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"9493_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-36136-7_9","volume-title":"Algorithms and Computation, 13th International Symposium (ISAAC 2002)","author":"M.J. Kreveld van","year":"2002","unstructured":"van Kreveld, M.J., Speckmann, B.: Cutting a country for smallest square fit. In: Bose, P., Morin, P. (eds.) Algorithms and Computation, 13th International Symposium (ISAAC 2002), Vancouver, BC, Canada, November 21\u201323, 2002. Lecture Notes in Computer Science, vol. 2518, pp. 91\u2013102. Springer, Berlin (2002)"},{"issue":"3","key":"9493_CR62","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.cag.2011.03.004","volume":"35","author":"T. Lankveld van","year":"2011","unstructured":"van Lankveld, T., van Kreveld, M.J., Veltkamp, R.C.: Identifying rectangles in laser range data for urban scene reconstruction. Comput. Graph. 35(3), 719\u2013725 (2011)","journal-title":"Comput. Graph."},{"key":"9493_CR63","unstructured":"Xu, Y.-C., Xiao, R.-B., Amos, M.:. Simulated annealing for weighted polygon packing. arXiv:0809.5005"},{"issue":"3","key":"9493_CR64","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1137\/050622560","volume":"17","author":"E.A. Yildirim","year":"2006","unstructured":"Yildirim, E.A.: On the minimum volume covering ellipsoid of ellipsoids. SIAM J. Optim. 17(3), 621\u2013641 (2006)","journal-title":"SIAM J. Optim."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9493-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9493-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9493-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T17:51:18Z","timestamp":1563645078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9493-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,14]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9493"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9493-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,14]]}}}