{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:08:11Z","timestamp":1770743291058,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00453-009-9346-8","type":"journal-article","created":{"date-parts":[[2009,9,10]],"date-time":"2009-09-10T18:23:55Z","timestamp":1252607035000},"page":"349-367","source":"Crossref","is-referenced-by-count":6,"title":["Peeling Meshed Potatoes"],"prefix":"10.1007","volume":"60","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,11]]},"reference":[{"key":"9346_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0097539796312721","volume":"29","author":"A. Aggarwal","year":"1999","unstructured":"Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The angular-metric traveling salesman problem. SIAM J. Comput. 29, 697\u2013711 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9346_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/34.75509","volume":"13","author":"E.M. Arkin","year":"1991","unstructured":"Arkin, E.M., Chew, L.P., Huttenlocher, D.P., Kedem, K., Mitchell, J.S.B.: An efficiently computable metric for comparing polygonal shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3), 209\u2013216 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9346_CR3","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":"9346_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/PL00009204","volume":"21","author":"E.M. Arkin","year":"1998","unstructured":"Arkin, E.M., Chiang, Y.-J., Held, M., Mitchell, J.S.B., Sacrist\u00e1n, V., Skiena, S.S., Yang, T.-C.: On minimum-area hulls. Algorithmica 21, 119\u2013136 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"9346_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cag.2006.10.006","volume":"31","author":"G. Barequet","year":"2007","unstructured":"Barequet, G., Rogol, V.: Maximizing the area of an axially symmetric polygon inscribed in a simple polygon. Comput. Graph. 31(1), 127\u2013136 (2007)","journal-title":"Comput. Graph."},{"key":"9346_CR6","unstructured":"Boland, R., Urrutia, J.: Finding the largest axis aligned rectangle in a polygon in O(nlog\u2009n) time. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG\u201901), pp. 41\u201344 (2001)"},{"key":"9346_CR7","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":"9346_CR8","series-title":"Adv. Comput. Res.","first-page":"1","volume-title":"Computational Geometry","author":"B. Chazelle","year":"1983","unstructured":"Chazelle, B.: The polygon containment problem. In: Preparata, F.P. (ed.) Computational Geometry. Adv. Comput. Res., vol. 1, pp. 1\u201333. JAI Press, Greenwich (1983)"},{"key":"9346_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1142\/S0218654303000139","volume":"9","author":"D. Cohen-Or","year":"2003","unstructured":"Cohen-Or, D., Lev-Yehudi, S., Karol, A., Tal, A.: Inner-cover of non-convex shapes. Int. J. Shape Model. 9, 223\u2013238 (2003)","journal-title":"Int. J. Shape Model."},{"key":"9346_CR10","unstructured":"Coorg, S.R., Teller, S.J.: Real-time occlusion culling for models with large occluders. In: Symposium on Interactive 3D Graphics, pp. 83\u201390, 189, (1997)"},{"key":"9346_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0925-7721(95)00041-0","volume":"7","author":"K. Daniels","year":"1997","unstructured":"Daniels, K., Milenkovic, V., Roth, D.: Finding the maximum area axis-parallel rectangle in a polygon. Comput. Geom. Theory Appl. 7, 125\u2013148 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"9346_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Comput. Geom. Theory Appl. 8(4), 195\u2013218 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9346_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9346_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00183192","volume":"11","author":"J.E. Goodman","year":"1981","unstructured":"Goodman, J.E.: On the largest convex polygon contained in a non-convex n-gon or how to peel a potato. Geom. Dedicata 11, 99\u2013106 (1981)","journal-title":"Geom. Dedicata"},{"key":"9346_CR15","doi-asserted-by":"crossref","unstructured":"Hall-Holt, O., Katz, M.J., Kumar, P., Mitchell, J.S.B., Sityon, A.: Finding large sticks and potatoes in polygons. In: SODA \u201906: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 474\u2013483 (2006)","DOI":"10.1145\/1109557.1109610"},{"key":"9346_CR16","doi-asserted-by":"crossref","unstructured":"Niblack, W., Yin, J.: A pseudo-distance measure for 2D shapes based on turning angle. In: Proceedings of the International Conference on Image Processing (ICIP), pp. 352\u2013355 (1995)","DOI":"10.1109\/ICIP.1995.537646"},{"key":"9346_CR17","unstructured":"Papaioannou, D.C.G., Gaitatzes, A.: Efficient occlusion culling using solid occluders. In: Proceedings of the 14th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (2006)"},{"issue":"3","key":"9346_CR18","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/s00453-007-9042-5","volume":"50","author":"I. Reinbacher","year":"2008","unstructured":"Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S.B., Snoeyink, J., Wolff, A.: Delineating boundaries for imprecise regions. Algorithmica 50(3), 386\u2013414 (2008)","journal-title":"Algorithmica"},{"key":"9346_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0925-7721(94)90011-6","volume":"4","author":"M. Sharir","year":"1994","unstructured":"Sharir, M., Toledo, S.: Extremal polygon containment problems. Comput. Geom. Theory Appl. 4, 99\u2013118 (1994)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9346_CR20","unstructured":"Woo, T.C.: The convex skull problem. Technical report TR 86-31, Department of Industrial and Operations Engineering, University of Michigan (1986)"},{"issue":"4","key":"9346_CR21","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02187918","volume":"3","author":"D. Wood","year":"1988","unstructured":"Wood, D., Yap, C.K.: The orthogonal convex skull problem. Discrete Comput. Geom. 3(4), 349\u2013365 (1988)","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9346-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T03:00:28Z","timestamp":1739329228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9346-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9346"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9346-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,11]]}}}