{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:45Z","timestamp":1751282865208},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:41:21Z","timestamp":1330198881000},"page":"95-102","source":"Crossref","is-referenced-by-count":6,"title":["Improved bounds for covering general polygons with rectangles"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"9_CR1","unstructured":"Chazelle, B.M., \u201cComputational Geometry and Convexity\u201d, PhD Dissertation, 1980, pp 140\u2013145."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Chaiken, S., D.J. Kleitman, M. Saks and J. Shearer, \u201cCovering Regions by Rectangles\u201d, SIAM J. Alg. Disc. Meth., vol. 2, no. 4, 1981.","DOI":"10.1137\/0602042"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Franzblau, D., D. Kleitman, \u201cAn Algorithm for Constructing Regions with Rectangles\u201d, Proc. 16th Annual ACM Symp. on Theory of Comp., 1984.","DOI":"10.1145\/800057.808678"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Heged\u00fcs, A., \u201cAlgorithms for covering polygons by rectangles, Computer Aided Design\u201d, vol. 14, no. 5, 1982.","DOI":"10.1016\/0010-4485(82)90104-X"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., \u201cEfficient computation of continuous skeletons\u201d, 20th Annual IEEE Symp. on Found. of Comp. Sc., 1979.","DOI":"10.1109\/SFCS.1979.15"},{"key":"9_CR6","unstructured":"Levcopoulos, C., \u201cOn Covering Regions with Minimum Number of Rectangles\u201d, Proc. International Workshop on Parallel Computing and VLSI, Amalfi, Italy, 1984 (North Holland)."},{"key":"9_CR7","unstructured":"Levcopoulos, C., \u201cA Fast Heuristic for Covering Polygons by Rectangles\u201d, Proc. Fundamentals of Comp. Theory, Cottbus, GDR, 1985 (LNCS Springer-Verlag)."},{"key":"9_CR8","unstructured":"Levcopoulos, C., \u201cCovering hole-free polygons with rectangles\u201d (preliminary title), in preparation."},{"key":"9_CR9","unstructured":"Levcopoulos, C., A. Lingas, \u201cCovering Polygons with Minimum Number of Rectangles\u201d, STACS'84, Paris (LNCS Springer Verlag)."},{"key":"9_CR10","unstructured":"Masek, W.J., \u201cSome NP-complete set covering problems\u201d, manuscript, MIT, August 1979."},{"key":"9_CR11","unstructured":"O'Rourke, J., \u201cThe decidability of covering by convex polygons\u201d, manuscript, The John Hopkins University, May 1982."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"IT-29","author":"J. O'Rourke","year":"1983","unstructured":"O'Rourke, J., and K.J. Supowit, \u201cSome NP-hard Polygon Decomposition Problems\u201d, IEEE Trans. on Information Theory, Vol. IT-29, 2, (1983), 181\u2013190.","journal-title":"IEEE Trans. on Information Theory"},{"key":"9_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F.P., and M.I. Shamos, \u201cComputational Geometry\u201d, New York, Springer-Verlag, 1985."},{"key":"9_CR14","unstructured":"Yamashita, M., T. Ibaraki and N. Honda, \u201cThe minimum number cover problem of a rectilinear region by rectangles\u201d, Toyohashi Univ. of Technology, 1984. (abstract appeared in the Bulletin of EATCS, October 1984)."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Wiernik, A., \u201cPlanar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments\u201d, in Proc. of the 27th IEEE Symp. on Foundations of Computer Science, October 1986.","DOI":"10.1109\/SFCS.1986.43"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:14Z","timestamp":1605644114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}