{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:27:01Z","timestamp":1787495221447,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540548911","type":"print"},{"value":"9783540464594","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54891-2_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:16:42Z","timestamp":1330193802000},"page":"13-25","source":"Crossref","is-referenced-by-count":6,"title":["An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Becker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo Giulio","family":"Franciosa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Gschwind","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Ohler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerald","family":"Thiem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/BFb0032068","volume-title":"Automata, Languages and Programming (Proc. of the 17th ICALP","author":"H. Alt","year":"1990","unstructured":"H. Alt, J. Blomer, M. Godau, and H. Wagener. Approximation of convex polygons. In Automata, Languages and Programming (Proc. of the 17th ICALP, Univ. of Warwick, England, July 1990), Lecture Notes in Computer Science 443, pages 703\u2013716, 1990."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195991000025","volume":"1","author":"L. Guibas","year":"1991","unstructured":"L. Guibas, J. Hershberger, and J. Snoeyink. Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry & Applications, 1:1\u201322, 1991.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0196-6774(86)90007-6","volume":"7","author":"J. O'Rourke","year":"1986","unstructured":"J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin. An optimal algorithm for finding minimal enclosing triangles. Journal of the Algorithms, 7:258\u2013269, 1986.","journal-title":"Journal of the Algorithms"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0255(84)90025-2","volume":"33","author":"Th. Ottmann","year":"1984","unstructured":"Th. Ottmann, E. Soisalon-Soininen, and D. Wood. On the definition and computation of rectilinear convex hulls. Information Sciences, 33:157\u2013171, 1984.","journal-title":"Information Sciences"},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry, an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry, an Introduction. Springer-Verlag, New York, 1985."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"O. Schwarzkopf, U. Fuchs, G. Rote, and E. Welzl. Approximation of convex figures by pairs of rectangles. Report B 89-15, Freie Universitaet Berlin, Department of Mathematics, 1989.","DOI":"10.1007\/3-540-52282-4_47"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"S. Skyum. A simple algorithm for computing the smallest enclosing circle. Report DAIMI 314, Aarhus University, Computer Science Department, 1990.","DOI":"10.7146\/dpb.v19i314.6704"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"R. B. Tilove. Set membership classification: A unified approach to geometric intersection problems. IEEE Trans. on Computers, pages 874\u2013883, 1980.","DOI":"10.1109\/TC.1980.1675470"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry-Methods, Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54891-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T17:24:31Z","timestamp":1742577871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54891-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540548911","9783540464594"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-54891-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}