{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:22Z","timestamp":1759638802471},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":[[1992,12]]},"DOI":"10.1016\/0020-0190(92)90210-m","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"255-259","source":"Crossref","is-referenced-by-count":31,"title":["On the optimal binary plane partition for sets of isothetic rectangles"],"prefix":"10.1016","volume":"44","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo Giulio","family":"Franciosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90210-M_BIB1","unstructured":"F. d'Amore and P.G. Franciosa, Separating sets of hyper-rectangles Internat. J. Comput. Geom. Appl., to appear."},{"key":"10.1016\/0020-0190(92)90210-M_BIB2","doi-asserted-by":"crossref","unstructured":"H. Fuchs, Z. Kedem, B. Naylor, On visible surface generation by a priori tree structures, Computer Graphics14, pp. 124\u2013133.","DOI":"10.1145\/965105.807481"},{"key":"10.1016\/0020-0190(92)90210-M_BIB3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90210-M_BIB4","series-title":"Proc. 5th Ann. Symp. on Computational Geometry","first-page":"23","article-title":"Binary partitions with applications to hidden-surface removal and solid modelling","author":"Paterson","year":"1989"},{"key":"10.1016\/0020-0190(92)90210-M_BIB5","series-title":"Research Rept. 158","article-title":"Optimal binary space partitions for orthogonal objects","author":"Paterson","year":"1990"},{"key":"10.1016\/0020-0190(92)90210-M_BIB6","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(92)90210-M_BIB7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0196-6774(82)90016-5","article-title":"Rectilinear line segment intersection, layered segment trees, and dynamization","volume":"3","author":"Vaishnavi","year":"1982","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290210M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290210M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:42Z","timestamp":1555129542000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290210M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["002001909290210M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90210-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}