{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:17Z","timestamp":1725664097104},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:38:02Z","timestamp":1330270682000},"page":"61-72","source":"Crossref","is-referenced-by-count":5,"title":["New results on binary space partitions in the plane (extended abstract)"],"prefix":"10.1007","author":[{"given":"Mark","family":"Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"Groot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"6_CR1","unstructured":"C. Ballieux. Motion planning using binary space partition. Report inf\/src\/93-25, Utrecht University, 1993."},{"key":"6_CR2","unstructured":"B. Chazelle. personal communication, 1993."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"N. Chin and S. Feiner. Near real time shadow generation using bsp trees. In SIGGRAPH'90, pages 99\u2013106, 1990.","DOI":"10.1145\/74334.74343"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"F. d'Amore and P. G. Franciosa. On the optimal binary plane partition for sets of isothetic rectangles. In Proc. 4th Canad. Conf. Comput. Geom., pages 1\u20135, 1992.","DOI":"10.1016\/0020-0190(92)90210-M"},{"key":"6_CR5","volume-title":"Ph.D. dissertation","author":"M. Berg de","year":"1992","unstructured":"M. de Berg. Efficient algorithms for ray shooting and hidden surface removal. Ph.D. dissertation, Dept. Comput. Sci., Univ. Utrecht, Utrecht, Netherlands, 1992."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"H. Edelsbrunner. Computing the extreme distances between two convex polygons. J. Algorithms, 6:213\u2013224, 1985.","journal-title":"J. Algorithms"},{"issue":"3","key":"6_CR7","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_CR8","doi-asserted-by":"crossref","unstructured":"B. Naylor, J. Amanatides, and W. Thibault. Merging bsp trees yields polyhedral set operations. In SIGGRAPH'90, pages 115\u2013124, 1990.","DOI":"10.1145\/97879.97892"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"M. H. Overmars. Range searching in a set of line segments. In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 177\u2013185, 1985.","DOI":"10.1145\/323233.323257"},{"key":"6_CR10","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_CR11","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_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0210035","volume":"10","author":"F. P. Preparata","year":"1981","unstructured":"F. P. Preparata. A new approach to planar point location. SIAM J. Comput., 10:473\u2013482, 1981.","journal-title":"SIAM J. Comput."},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"6_CR14","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_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","volume":"3","author":"A. Stappen van der","year":"1993","unstructured":"A. van der Stappen, D. Halperin, and M. Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Computational Geometry: Theory and Applications, 3:353\u2013373, 1993.","journal-title":"Computational Geometry: Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:51Z","timestamp":1605647931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}