{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:33:51Z","timestamp":1767339231260},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1007\/bf01898354","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T14:39:48Z","timestamp":1120574388000},"page":"112-117","source":"Crossref","is-referenced-by-count":33,"title":["Minimum area circumscribing Polygons"],"prefix":"10.1007","volume":"1","author":[{"given":"Alok","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"J. S.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01898354_CR1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0214011","volume":"14","author":"JE Boyce","year":"1985","unstructured":"Boyce JE, Dobkin DP, Drysdale RL, Guibas LJ (1985) Finding extremal polygons. SIAM J Comp 14:134\u2013147","journal-title":"SIAM J Comp"},{"key":"BF01898354_CR2","volume-title":"Advances in Robotics","author":"BM Chazelle","year":"1985","unstructured":"Chazelle BM (1985) Approximation and decomposition of shapes, In: Yap CK, Schwartz J (eds) Advances in Robotics. Vol 1. Lawrence O'Erlbaum Inc."},{"key":"BF01898354_CR3","doi-asserted-by":"crossref","unstructured":"Chang JS, Yap CK (1984) A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems. Proc. of the 25-th Annual Symposium on the Foundations of Computer Science. pp 408\u2013419","DOI":"10.1109\/SFCS.1984.715942"},{"key":"BF01898354_CR4","unstructured":"DePano A (1984) Onk-envelopes and shared edges. Technical Report. Department of Electric Engineering and Computer Science. The Johns Hopkins University"},{"key":"BF01898354_CR5","unstructured":"DePano A, Aggarwal A (1984) Finding restricted K-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing"},{"key":"BF01898354_CR6","doi-asserted-by":"crossref","unstructured":"Dobkin DP, Snyder L (1979) On a general method for maximizing and minimizing among certain geometric problems. Proceedings of the Twentieth Annual Symposium on the Foundations of Computer Science. pp 7\u201319","DOI":"10.1109\/SFCS.1979.28"},{"key":"BF01898354_CR7","unstructured":"Dobkin DP, Drysdale RL, Guibas LJ (1983) Finding smallest polygons In: Preparata FP (ed) Advances in Computing Research. Jai Press. pp 181\u2013214"},{"key":"BF01898354_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(83)90040-3","volume":"24","author":"D Dori","year":"1983","unstructured":"Dori D, Ben-Bessat M (1983) Circumscribing a convex polygon with polygon of fewer sides with minimal area addition. Comput Vision Graph Image Proc 24:131\u2013159","journal-title":"Comput Vision Graph Image Proc"},{"key":"BF01898354_CR9","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360881.360919","volume":"18","author":"H Freeman","year":"1975","unstructured":"Freeman H, Shapira R (1975) Determining the minimum area encasing a package. CACM 18:409\u2013413","journal-title":"CACM"},{"key":"BF01898354_CR10","doi-asserted-by":"crossref","unstructured":"Klee V, Laskowski MC (1985) Finding the smallest triangles containing the given polygon' J Algorithms","DOI":"10.1016\/0196-6774(85)90005-7"},{"key":"BF01898354_CR11","unstructured":"O'Rourke J (1984) Counterexamples to a minimal circumscription algorithm. Manuscript The Johns Hopkins University"},{"key":"BF01898354_CR12","doi-asserted-by":"crossref","unstructured":"O'Rourke J, Aggarwal A, Madilla S, Baldwin M (1985) An optimal algorithm for finding minimal enclosing triangles. J Algorithms","DOI":"10.1016\/0196-6774(86)90007-6"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898354.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01898354\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T17:54:21Z","timestamp":1683136461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01898354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["BF01898354"],"URL":"https:\/\/doi.org\/10.1007\/bf01898354","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}