{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:14Z","timestamp":1759638614890},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf02238431","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T17:39:24Z","timestamp":1131989964000},"page":"191-206","source":"Crossref","is-referenced-by-count":4,"title":["On optimal cuts of hyperrectangles"],"prefix":"10.1007","volume":"55","author":[{"given":"F.","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. H.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02238431_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1142\/S0218195993000105","volume":"3","author":"F. d'Amore","year":"1993","unstructured":"d'Amore, F., Franciosa, P. G.: Separating sets of hyperrectangles. Int. J. Comp. Geometry Appl.3, 155\u2013165, 345 (1993).","journal-title":"Int. J. Comp. Geometry Appl."},{"key":"BF02238431_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(92)90210-M","volume":"44","author":"F. d'Amore","year":"1992","unstructured":"d'Amore, F., Franciosa, P. G.: On the optimal binary plane partition for sets of isothetic rectangles. IPL44, 255\u2013259 (1992).","journal-title":"IPL"},{"key":"BF02238431_CR3","first-page":"215","volume-title":"Graphics, design and visualization. IFIP Transactions B-9","author":"F. d'Amore","year":"1993","unstructured":"d'Amore, F., Roos, T., Widmayer, P.: An optimal algorithm for computing a best cut of a set of hyperrectangles. In: Graphics, design and visualization. IFIP Transactions B-9 (Pattanaik, S. N., Mudur, S. P., eds.), pp. 215\u2013224. Amsterdam: Elsevier 1993."},{"key":"BF02238431_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. Proc. 15th ACM STOC, pp. 80\u201386 (1983).","DOI":"10.1145\/800061.808735"},{"key":"BF02238431_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"Bentley, J. L.: Multidimensional binary search trees used for associative searching. Comm. ACM,18, 509\u2013517 (1975).","journal-title":"Comm. ACM"},{"key":"BF02238431_CR6","unstructured":"de Berg, M., de Groot, M., Overmars, M.: Perfect binary space partitions. Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Ontario, pp. 109\u2013114 (1993)."},{"key":"BF02238431_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-58218-5_6","volume":"824","author":"M. Berg de","year":"1994","unstructured":"de Berg, M., de Groot, M., Overmars, M.: New results on binary space partitions in the plane. Proc. SWAT'94. Lecture Notes in Computer Science Vol.824, 61\u201372 (1994).","journal-title":"Proc. SWAT'94. Lecture Notes in Computer Science Vol."},{"key":"BF02238431_CR8","unstructured":"de Berg, M., de Groot, M.: Binary space partitions for sets of cubes, Abstracts 10th European Workshop Comput. Geom. (CG'94), pp. 84\u201388 (1994)."},{"key":"BF02238431_CR9","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","volume":"21","author":"M. L. Fredman","year":"1978","unstructured":"Fredman, M. L., Weide, B.: On the complexity of computing the measure of U[ai, bj]. Comm. ACM21, 540\u2013544 (1978).","journal-title":"Comm. ACM"},{"key":"BF02238431_CR10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/965105.807481","volume":"14","author":"H. Fuchs","year":"1980","unstructured":"Fuchs, H., Kedem, Z., Naylor, B.: On visible surface generation by a priori tree structures, Comput. Graphics.14, 124\u2013133 (1980).","journal-title":"Comput. Graphics."},{"key":"BF02238431_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees.: a dynamic index structure for spatial searching Proc. ACM SIGMOD, pp. 47\u201357 (1984).","DOI":"10.1145\/971697.602266"},{"key":"BF02238431_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/97880.97892","volume":"24","author":"J. A. Amatodes","year":"1990","unstructured":"Amatodes, J. A., Naylor, B., Thibault, W.: Merging BSP trees yields polyhedral set operations. Comp. Graphics24, 115\u2013124 (1990).","journal-title":"Comp. Graphics"},{"key":"BF02238431_CR13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K. C.: The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst.9, 38\u201371 (1984).","journal-title":"ACM Trans. Database Syst."},{"key":"BF02238431_CR14","unstructured":"Nguyen, V. H., Ross, T., Widmayer, P.: Balanced cuts of a set of hyperrectangles. Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Ontario, pp. 121\u2013126 (1993)."},{"key":"BF02238431_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02187806","volume":"5","author":"M. S. Paterson","year":"1990","unstructured":"Paterson, M. S., Yao, F. F.: Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom.5, 485\u2013503 (1990).","journal-title":"Discrete Comput. Geom."},{"key":"BF02238431_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0196-6774(92)90007-Y","volume":"13","author":"M. S. Paterson","year":"1992","unstructured":"Paterson, M. S., Yao, F. F.: Optimal binary space partitions for orthogonal objects. J. Algorithms13, 99\u2013113 (1992).","journal-title":"J. Algorithms"},{"key":"BF02238431_CR17","volume-title":"The design and analysis of spatial data structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The design and analysis of spatial data structures. Reading: Addison-Wesley 1990."},{"key":"BF02238431_CR18","doi-asserted-by":"crossref","unstructured":"Thibault, W. C., Naylor, B. F.: Set operations on polyhedra using binary space partitioning trees. Proc. SIGGRAPH'87, pp. 153\u2013162 (1987).","DOI":"10.1145\/37401.37421"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238431.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238431\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:29:42Z","timestamp":1586554182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF02238431"],"URL":"https:\/\/doi.org\/10.1007\/bf02238431","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}