{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:41:59Z","timestamp":1649212919565},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,10]]},"abstract":"<jats:p> We analyze the heuristic proposed by Jung [3] to partition a 3D phantom into homogeneous cuboids. We show that the 2D version of this heuristic generates the minimum number of rectangles when partitioning 2D non-degenerate phantoms. However, this 2D version doesn't generate optimal partitions of degenerate 2D phantoms. In fact, the heuristic may generate more than 3 times as many rectangles as is necessary. The 3D heuristic of [3] doesn't generate optimal partitionings of 3D simple phantoms either. We show that slicing partitions of 3D simple phantoms are optimal. Our analysis suggests a new heuristic for 3D phantoms. This heuristic generated one-third as many cuboids when used to partition a 3D CT-scan phantom and about one-fourth as many cuboids on randomly generated 3D phantoms as produced by the heuristic of [3]. <\/jats:p>","DOI":"10.1142\/s0129054103002084","type":"journal-article","created":{"date-parts":[[2003,11,24]],"date-time":"2003-11-24T04:26:19Z","timestamp":1069647979000},"page":"905-931","source":"Crossref","is-referenced-by-count":2,"title":["PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS"],"prefix":"10.1142","volume":"14","author":[{"given":"ANUJ","family":"JAIN","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science  and Engineering, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SARTAJ","family":"SAHNI","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science  and Engineering, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JATINDER","family":"PALTA","sequence":"additional","affiliation":[{"name":"Department of Radiation Oncology, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAMES","family":"DEMPSEY","sequence":"additional","affiliation":[{"name":"Department of Radiation Oncology, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90207-X"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1137\/0215033"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1118\/1.596810"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/43.3182"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/43.45869"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103002084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:37:58Z","timestamp":1565123878000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103002084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":5,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,10]]}},"alternative-id":["10.1142\/S0129054103002084"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103002084","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}