{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:15:02Z","timestamp":1649211302982},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0020-0190(01)00203-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"137-141","source":"Crossref","is-referenced-by-count":2,"title":["Lower bounds for approximate polygon decomposition and minimum gap"],"prefix":"10.1016","volume":"81","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(01)00203-4_BIB001","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(92)90133-G","article-title":"Optimal time bounds for some proximity problems in the plane","volume":"42","author":"Aggarwal","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0190(01)00203-4_BIB002","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1142\/S021819599600006X","article-title":"A linear-time algorithm for covering simple polygons with similar rectangles","volume":"6","author":"Bar-Yehuda","year":"1996","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/S0020-0190(01)00203-4_BIB003","series-title":"Proc. 15th ACM Annual Symposium on Theory of Computation, Boston, MA","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983"},{"key":"10.1016\/S0020-0190(01)00203-4_BIB004","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF02523677","article-title":"On the complexities of efficient solutions of the rectilinear polygon cover problems","volume":"17","author":"Berman","year":"1997","journal-title":"Algoritmica"},{"issue":"5","key":"10.1016\/S0020-0190(01)00203-4_BIB005","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/S0020-0190(01)00203-4_BIB006","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/32.6142","article-title":"A new method of image compression using irreducible covers of maximal rectangles","volume":"14","author":"Cheng","year":"1988","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/S0020-0190(01)00203-4_BIB007","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/0402027","article-title":"Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles","volume":"2","author":"Franzblau","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(01)00203-4_BIB008","series-title":"Handbook of Computational Geometry","first-page":"491","article-title":"Polygon decomposition","author":"Keil","year":"1999"},{"key":"10.1016\/S0020-0190(01)00203-4_BIB009","series-title":"Proc. 7th Foundations of Software Technology and Theoretical Computer Science","article-title":"Improved bounds for covering general polygons with rectangles","volume":"287","author":"Levcopoulos","year":"1987"},{"key":"10.1016\/S0020-0190(01)00203-4_BIB010","series-title":"Proc. 5th Annual ACM Symposium on Computational Geometry, Saarbr\u00fccken, Germany","first-page":"344","article-title":"Minimum partitioning simple rectilinear polygons in O(nloglogn) time","author":"Liou","year":"1989"},{"issue":"2","key":"10.1016\/S0020-0190(01)00203-4_BIB011","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1142\/S0218195991000128","article-title":"Covering convex rectilinear polygons in linear time","volume":"1","author":"Liou","year":"1991","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/S0020-0190(01)00203-4_BIB012","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0020-0190(01)00203-4_BIB013","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02189307","article-title":"Minimum dissection of rectilinear polygon with arbitrary holes into rectangles","volume":"9","author":"Soltan","year":"1993","journal-title":"Discrete Comput. Geometry"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:22:46Z","timestamp":1556896966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0020019001002034"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00203-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}