{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089482},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606888"},{"type":"electronic","value":"9783540492627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60688-2_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:52:26Z","timestamp":1330289546000},"page":"59-72","source":"Crossref","is-referenced-by-count":0,"title":["Binary space partitions for sets of hyperrectangles"],"prefix":"10.1007","author":[{"given":"Viet Hai","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle. Filtering search: a new approach to query-answering. SIAM J. Comput., 15:703\u2013724, 1986.","journal-title":"SIAM J. Comput."},{"key":"6_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":"F. d'Amore and P. G. Franciosa. On the optimal binary plane partition for sets of isothetic rectangles. Inform. Process. Lett., 44:255\u2013259, 1992.","journal-title":"Inform. Process. Lett."},{"key":"6_CR3","volume-title":"Linear size binary space partitions for fat objects","author":"M. Berg de","year":"1995","unstructured":"M. de Berg. Linear size binary space partitions for fat objects. To appear, Dept. of Computer Science, Utrecht University, the Netherlands, 1995. (accepted for Euro. Symp. on Algorithms, ESA'95)."},{"key":"6_CR4","unstructured":"M. de Berg and M. de Groot. Binary space partitions for sets of cubes. In Abstracts 10th European Workshop Comput. Geom. (CG'94), pages 84\u201388, 1994."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-58218-5_6","volume":"824","author":"M. Berg de","year":"1994","unstructured":"M. de Berg, M. de Groot, and M. Overmars. New results on binary space partitions in the plane. In Proc. 4th Scand. Workshop Algorithm Theory, volume 824 of Lecture Notes in Computer Science, pages 61\u201372, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR6","volume-title":"volume 10 of EATCS Monographs on Theoretical Computer Science","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987."},{"key":"6_CR7","volume-title":"Introduction to Computer Graphics","author":"J. D. Foley","year":"1993","unstructured":"J. D. Foley, A. van Dam, S. K. Feiner, J. F. Hughes, and Phillips. Introduction to Computer Graphics. Addison-Wesley, Reading, MA, 1993."},{"issue":"3","key":"6_CR8","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/965105.807481","volume":"14","author":"H. Fuchs","year":"1980","unstructured":"H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14(3):124\u2013133, 1980.","journal-title":"Comput. Graph."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E. M. McCreight","year":"1985","unstructured":"E. M. McCreight. Priority search trees. SIAM J. Comput., 14:257\u2013276, 1985.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/97880.97892","volume":"24","author":"B. Naylor","year":"1990","unstructured":"B. Naylor, J. A. Amatodes, and W. Thibault. Merging BSP trees yields polyhedral set operations. Comput. Graph., 24(4):115\u2013124, August 1990.","journal-title":"Comput. Graph."},{"key":"6_CR11","unstructured":"V. H. Nguyen, T. Roos, and P. Widmayer. Balanced cuts of a set of hyperrectangles. In Proc. 5th Canad. Conf. Comput Geom., pages 121\u2013126, Waterloo, Canada, 1993."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. on Database Systems, 9:38\u201371, 1984.","journal-title":"ACM Trans. on Database Systems"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02187806","volume":"5","author":"M. S. Paterson","year":"1990","unstructured":"M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom., 5:485\u2013503, 1990.","journal-title":"Discrete Comput. Geom."},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0196-6774(92)90007-Y","volume":"13","author":"M. S. Paterson","year":"1992","unstructured":"M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13:99\u2013113, 1992.","journal-title":"J. Algorithms"},{"key":"6_CR15","unstructured":"H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, 1990."},{"issue":"3","key":"6_CR16","first-page":"124","volume":"14","author":"R. A. Schumaker","year":"1969","unstructured":"R. A. Schumaker, R. Brand, M. Gilliland, and W. Sharp. Study for applying computer-generated images to visual simulation. Report AFHRL-TR-69-14, U.S. Air Force Human Resources Lab., 1969. cited in [8].","journal-title":"Report AFHRL-TR-69-14, U.S. Air Force Human Resources Lab."},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/356625.356626","volume":"6","author":"I. E. Sutherland","year":"1974","unstructured":"I. E. Sutherland, R. F. Sproull, and R. A. Schumaker. A characterization of ten hidden surface algorithms. ACM Comput. Surv., 6:1\u201355, 1974. cited in [8].","journal-title":"ACM Comput. Surv."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"S. Teller and P. Hanrahan. Global visibility algorithms for illumination computations. In Proc. SIGGRAPH '93, pages 239\u2013246, 1993.","DOI":"10.1145\/166117.166148"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. In Proc. SIGGRAPH'87, pages 153\u2013162, 1987.","DOI":"10.1145\/37401.37421"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","volume":"3","author":"A. F. Stappen van der","year":"1993","unstructured":"A. F. van der Stappen, D. Halperin, and M. H. Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory and Appl., 3:353\u2013373, 1993.","journal-title":"Comput. Geom. Theory and Appl."},{"issue":"2","key":"6_CR21","first-page":"133","volume":"4","author":"P. Oosterom van","year":"1990","unstructured":"P. van Oosterom. A modified binary space partition for geographic information systems. Int. J. GIS, 4(2):133\u2013146, 1990.","journal-title":"Int. J. GIS"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Concurrency and Knowledge"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60688-2_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:55Z","timestamp":1619573215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60688-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606888","9783540492627"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60688-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}