{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:13:19Z","timestamp":1760440399095},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":["Computer Vision, Graphics, and Image Processing"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1016\/0734-189x(84)90139-7","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T03:36:05Z","timestamp":1108611365000},"page":"58-71","source":"Crossref","is-referenced-by-count":48,"title":["Minimal rectangular partitions of digitized blobs"],"prefix":"10.1016","volume":"28","author":[{"given":"L","family":"Ferrari","sequence":"first","affiliation":[]},{"given":"P.V","family":"Sankar","sequence":"additional","affiliation":[]},{"given":"J","family":"Sklansky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0734-189X(84)90139-7_BIB1","article-title":"On two dimensional data organization","volume":"2","author":"Lali","year":"1979","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"10.1016\/0734-189X(84)90139-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/MCG.1983.262975","article-title":"A polygon to rectangle conversion algorithm","volume":"3","author":"Gourley","year":"1983","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/0734-189X(84)90139-7_BIB3","article-title":"Some practical applications of digital filtering in image processing","volume":"2","author":"Seidman","year":"1972"},{"key":"10.1016\/0734-189X(84)90139-7_BIB4","article-title":"Recursive Binary Valued Image Filters","author":"Ferrari","year":"1980"},{"key":"10.1016\/0734-189X(84)90139-7_BIB5","series-title":"Digital Picture Processing","author":"Rosenfeld","year":"1976"},{"key":"10.1016\/0734-189X(84)90139-7_BIB6","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0734-189X(84)90139-7_BIB7","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0734-189X(84)90139-7_BIB8","series-title":"Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing","article-title":"Decomposing a Polygon into Its Convex Parts","author":"Chazelle","year":"1979"},{"key":"10.1016\/0734-189X(84)90139-7_BIB9","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"}],"container-title":["Computer Vision, Graphics, and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X84901397?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X84901397?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T16:26:10Z","timestamp":1548692770000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0734189X84901397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0734189X84901397"],"URL":"https:\/\/doi.org\/10.1016\/0734-189x(84)90139-7","relation":{},"ISSN":["0734-189X"],"issn-type":[{"value":"0734-189X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}