{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T13:26:13Z","timestamp":1684934773766},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,3,23]],"date-time":"2011-03-23T00:00:00Z","timestamp":1300838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00454-011-9341-0","type":"journal-article","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T10:37:17Z","timestamp":1300790237000},"page":"617-646","source":"Crossref","is-referenced-by-count":6,"title":["Binary Plane Partitions for Disjoint Line Segments"],"prefix":"10.1007","volume":"45","author":[{"given":"Csaba D.","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,23]]},"reference":[{"key":"9341_CR1","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.1137\/S0097539797320578","volume":"29","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Grove, E.F., Murali, T.M., Vitter, J.S.: Binary space partitions for fat rectangles. SIAM J. Comput. 29, 1422\u20131448 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"9341_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0925-7721(99)00049-8","volume":"15","author":"S. Ar","year":"2000","unstructured":"Ar, S., Chazelle, B., Tal, A.: Self-customized BSP trees for collision detection. Comput. Geom. Theory Appl. 15(1\u20133), 91\u2013102 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"9341_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1111\/1467-8659.00586","volume":"21","author":"S. Ar","year":"2002","unstructured":"Ar, S., Montag, G., Tal, A.: Deferred, self-organizing BSP trees. Comput. Graph. Forum 21(3), 269\u2013278 (2002)","journal-title":"Comput. Graph. Forum"},{"issue":"4","key":"9341_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0020-0190(02)00284-3","volume":"84","author":"S. Arya","year":"2002","unstructured":"Arya, S.: Binary space partitions for axis-parallel line segments: size-height tradeoffs. Inf. Process. Lett. 84(4), 201\u2013206 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9341_CR5","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s00454-003-2853-5","volume":"30","author":"T. Asano","year":"2003","unstructured":"Asano, T., de Berg, M., Cheong, O., Guibas, L.J., Snoeyink, J., Tamaki, H.: Spanning trees crossing few barriers. Discrete Comput. Geom. 30, 591\u2013606 (2003)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9341_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s004530010047","volume":"28","author":"M. Berg de","year":"2000","unstructured":"de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica 28(3), 353\u2013366 (2000)","journal-title":"Algorithmica"},{"issue":"3","key":"9341_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.comgeo.2005.08.003","volume":"33","author":"M. Berg de","year":"2006","unstructured":"de Berg, M., Streppel, M.: Approximate range searching using binary space partitions. Comput. Geom. Theory Appl. 33(3), 139\u2013151 (2006)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9341_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-7721(97)00008-4","volume":"8","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., de Groot, M., Overmars, M.: New results on binary space partitions in the plane. Comput. Geom. Theory Appl. 8, 317\u2013333 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9341_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0925-7721(03)00016-6","volume":"26","author":"M. Berg de","year":"2003","unstructured":"de Berg, M., David, H., Katz, M., Overmars, M., van\u00a0der Stappen, A.F., Vleugels, J.: Guarding scenes against invasive hypercubes. Comput. Geom. Theory Appl. 26, 99\u2013117 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9341_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"key":"9341_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B. Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L.J., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica 12, 54\u201368 (1994)","journal-title":"Algorithmica"},{"key":"9341_CR12","first-page":"21","volume":"25","author":"N. Chin","year":"1992","unstructured":"Chin, N., Feiner, S.: Fast object-precision shadow generation for areal light sources using BSP trees. Comput. Graph. 25, 21\u201330 (1992)","journal-title":"Comput. Graph."},{"issue":"2","key":"9341_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00454-003-0729-3","volume":"31","author":"A. Dumitrescu","year":"2004","unstructured":"Dumitrescu, A., Mitchell, J.S.B., Sharir, M.: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. Discrete Comput. Geom. 31(2), 207\u2013227 (2004)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9341_CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/965105.807481","volume":"14","author":"H. Fuchs","year":"1980","unstructured":"Fuchs, H., Kedem, Z.M., Naylor, B.: On visible surface generation by a priori tree structures. Comput. Graph. 14(3), 124\u2013133 (1980). Proc. SIGGRAPH","journal-title":"Comput. Graph."},{"issue":"3","key":"9341_CR15","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: Shoot a ray, take a walk. J. Algorithms 18(3), 403\u2013431 (1995)","journal-title":"J. Algorithms"},{"issue":"6","key":"9341_CR16","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1137\/S0097539704445706","volume":"34","author":"J. Hershberger","year":"2005","unstructured":"Hershberger, J., Suri, S., T\u00f3th, Cs.D.: Binary space partitions of orthogonal subdivisions. SIAM J. Comput. 34(6), 1380\u20131397 (2005)","journal-title":"SIAM J. Comput."},{"key":"9341_CR17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1542362.1542372","volume-title":"Proc. 25th ACM Sympos. Comput. Geom.","author":"M. Ishaque","year":"2009","unstructured":"Ishaque, M., Speckmann, B., T\u00f3th, Cs.D.: Shooting permanent rays among disjoint polygons in the plane. In: Proc. 25th ACM Sympos. Comput. Geom., pp. 51\u201360. ACM Press, New York (2009)"},{"key":"9341_CR18","first-page":"360","volume-title":"Proc. 11th ACM Sympos. Comput. Geom.","author":"C.S. Mata","year":"1995","unstructured":"Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems. In: Proc. 11th ACM Sympos. Comput. Geom., pp. 360\u2013369. ACM Press, New York (1995)"},{"key":"9341_CR19","first-page":"181","volume-title":"Proc. Graphics Interface","author":"B. Naylor","year":"1993","unstructured":"Naylor, B.: Constructing good partitioning trees. In: Proc. Graphics Interface, pp. 181\u2013191. Canadian Human-Computer Communications Society, Toronto (1993)"},{"key":"9341_CR20","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":"9341_CR21","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. Algorithms 13, 99\u2013113 (1992)","journal-title":"J. Algorithms"},{"key":"9341_CR22","doi-asserted-by":"crossref","unstructured":"Schumacker, R.A., Brand, R., Gilliland, M., Sharp, W.: Study for applying computer-generated images to visual simulation. Tech. Rep. AFHRL-TR-69-14, San Antonio, TX (1969)","DOI":"10.21236\/AD0700375"},{"issue":"4","key":"9341_CR23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/37402.37421","volume":"21","author":"W.C. Thibault","year":"1987","unstructured":"Thibault, W.C., Naylor, B.F.: Set operations on polyhedra using binary space partitioning trees. Comput. Graph. 21(4), 153\u2013162 (1987). Proc. SIGGRAPH \u201987","journal-title":"Comput. Graph."},{"key":"9341_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00454-003-2921-x","volume":"30","author":"Cs.D. T\u00f3th","year":"2003","unstructured":"T\u00f3th, Cs.D.: A note on binary plane partitions. Discrete Comput. Geom. 30, 3\u201316 (2003)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9341_CR25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/S0097539702403785","volume":"32","author":"Cs.D. T\u00f3th","year":"2003","unstructured":"T\u00f3th, Cs.D.: Binary space partition for line segments with a limited number of directions. SIAM J. Comput. 32(2), 307\u2013325 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9341_CR26","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/06065934X","volume":"38","author":"Cs.D. T\u00f3th","year":"2008","unstructured":"T\u00f3th, Cs.D.: Binary space partition for axis-aligned fat rectangles. SIAM J. Comput. 38(1), 429\u2013447 (2008)","journal-title":"SIAM J. Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9341-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-011-9341-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9341-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T07:06:49Z","timestamp":1560064009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-011-9341-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,23]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9341"],"URL":"https:\/\/doi.org\/10.1007\/s00454-011-9341-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,23]]}}}