{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T09:46:01Z","timestamp":1747302361402},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_50","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"591-602","source":"Crossref","is-referenced-by-count":4,"title":["The Union of Probabilistic Boxes: Maintaining the Volume"],"prefix":"10.1007","author":[{"given":"Hakan","family":"Y\u0131ld\u0131z","sequence":"first","affiliation":[]},{"given":"Luca","family":"Foschini","sequence":"additional","affiliation":[]},{"given":"John","family":"Hershberger","sequence":"additional","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K.: An improved algorithm for computing the volume of the union of cubes. In: Proc. of 26th Symp. on Computational Geometry, pp. 230\u2013239 (2010)","DOI":"10.1145\/1810959.1811000"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Kaplan, H., Sharir, M.: Computing the volume of the union of cubes. In: Proc. of 23rd Symp. on Computational Geometry, pp. 294\u2013301 (2007)","DOI":"10.1145\/1247069.1247121"},{"key":"50_CR3","unstructured":"Bentley, J.L.: Solutions to Klee\u2019s rectangle problems. Dept. of Comp. Sci., CMU, Pittsburgh PA (1977) (unpublished manuscript)"},{"key":"50_CR4","unstructured":"van den Bergen, G., Kaldewaij, A., Dielissen, V.J.: Maintenance of the union of intervals on a line revisited. Computing Science Reports. Eindhoven University of Technology (1998)"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann, K.: Klee\u2019s measure problem on fat boxes in time O(n (d\u2009+\u20092)\/3). In: Proc. of 26th Symp. on Computational Geometry, pp. 222\u2013229 (2010)","DOI":"10.1145\/1810959.1810999"},{"key":"50_CR6","unstructured":"CGAL, Computational Geometry Algorithms Library, http:\/\/www.cgal.org"},{"issue":"3","key":"50_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.comgeo.2009.01.007","volume":"43","author":"T.M. Chan","year":"2010","unstructured":"Chan, T.M.: A (slightly) faster algorithm for Klee\u2019s measure problem. Computational Geometry\u00a043(3), 243\u2013250 (2010)","journal-title":"Computational Geometry"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Janardan, R.: Efficient maintenance of the union intervals on a line, with applications. In: Proc. of ACM Symp. on Discrete Algorithms, pp. 74\u201383 (1990)","DOI":"10.1016\/0196-6774(91)90023-R"},{"key":"50_CR9","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)"},{"issue":"2","key":"50_CR10","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/0734-189X(83)90111-1","volume":"23","author":"G.H. Gonnet","year":"1983","unstructured":"Gonnet, G.H., Munro, J.I., Wood, D.: Direct dynamic structures for some line segment problems. Computer Vision, Graphics, and Image Processing\u00a023(2), 178\u2013186 (1983)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Klee, V.: Can the measure of \u222a\u2009[a i ,b i ] be computed in less than ${O}(n \\lg n)$ steps? American Mathematical Monthly, 284\u2013285 (1977)","DOI":"10.1080\/00029890.1977.11994336"},{"issue":"3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/0196-6774(81)90027-4","volume":"2","author":"J. Leeuwen van","year":"1981","unstructured":"van Leeuwen, J., Wood, D.: The measure problem for rectangular ranges in d-space. Journal of Algorithms\u00a02(3), 282\u2013300 (1981)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"50_CR13","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/0220065","volume":"20","author":"M.H. Overmars","year":"1991","unstructured":"Overmars, M.H., Yap, C.-K.: New upper bounds in Klee\u2019s measure problem. SIAM J. Comput.\u00a020(6), 1034\u20131045 (1991)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:07:57Z","timestamp":1560514077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}