{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:07:06Z","timestamp":1770743226447,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"value":"1402034423","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-3443-1_21","type":"book-chapter","created":{"date-parts":[[2005,7,28]],"date-time":"2005-07-28T04:35:57Z","timestamp":1122525357000},"page":"229-248","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Shape and Inclusion"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Chassery","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Coeurjolly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear time algorithm for computing the Voronoi diagram of a convex polygon. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 39\u201345, New York City, 25\u201327 May 1987.","DOI":"10.1145\/28395.28400"},{"issue":"13","key":"21_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/S0010-4485(00)00067-1","volume":"32","author":"C. Andjar","year":"2000","unstructured":"C. Andjar, C. Saona-Vzquez, and I. Navazo. LOD visibility culling and occluder synthesis. Computer Aided Design, 32(13):773\u2013783, November 2000.","journal-title":"Computer Aided Design"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02187692","volume":"1","author":"J. S. Chang","year":"1986","unstructured":"J. S. Chang and C. K. Yap. A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry, 1:155\u2013182, 1986.","journal-title":"Discrete & Computational Geometry"},{"key":"21_CR4","unstructured":"J.M. Chassery. Discrete and computational geometry approaches applied to a problem of figure approximation. In Proc. 6th Scandinzvian Conf. on Image Analysis (SCIA 89), pages 856\u2013859, Oulu City, 19\u201322 june 1989."},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0925-7721(95)00041-0","volume":"7","author":"K. Daniels","year":"1997","unstructured":"K. Daniels, V. Milenkovic, and D. yRoth. Finding the largest area axis-parallel rectangle in a polygon. Computational Geometry: Theory and Applications, 7:125\u2013148, 1997.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"H. Edelsbrunner. Computing the extreme distances between two convex polygons. Journal of Algorithms, 6:213\u2013224, 1985.","journal-title":"Journal of Algorithms"},{"key":"21_CR7","first-page":"99","volume":"11","author":"J. E. Goodman","year":"1981","unstructured":"J. E. Goodman. On the largest convex polygon contained in a non-convex n-gon or how to peel a potato. Geometricae Dedicata, 11:99\u2013106, 1981.","journal-title":"Geometricae Dedicata"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0925-7721(95)00041-0","volume":"7","author":"D. Roth","year":"1997","unstructured":"D. Roth K. Daniels, V. Milekovic. Finding the largest area axis-parallel rectangle in a polygon. Comput. Geom. Theory Appl, 7:125\u2013148, 1997.","journal-title":"Comput. Geom. Theory Appl"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0196-6774(86)90007-6","volume":"7","author":"J. O\u2019Rourke","year":"1986","unstructured":"J. O\u2019Rourke, A. Aggarwal, Sanjeev, R. Maddila, and M. Baldwin. An optimal algorithm for finding minimal enclosing triangles. J. Algorithms, 7(2):258\u2013269, 1986.","journal-title":"J. Algorithms"},{"key":"21_CR10","unstructured":"Joseph O\u2019Rourke. Computational Geometry in C. Cambridge University Press, 1993. ISBN 0-521-44034-3."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02187918","volume":"3","author":"D. Wood","year":"1988","unstructured":"D. Wood and C. K. Yap. The orthogonal convex skull problem. Discrete and Computational Geometry, 3:349\u2013365, 1988.","journal-title":"Discrete and Computational Geometry"}],"container-title":["Computational Imaging and Vision","Mathematical Morphology: 40 Years On"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-3443-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T15:40:58Z","timestamp":1619538058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-3443-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402034423"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/1-4020-3443-1_21","relation":{},"subject":[]}}