{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article11020","name":"Union of Hypercubes and 3D Minkowski Sums with Random Sizes","abstract":"Let T={triangle_1,...,triangle_n} be a set of of n pairwise-disjoint triangles in R^3, and let B be a convex polytope in R^3 with a constant number of faces. For each i, let C_i = triangle_i oplus r_i B denote the Minkowski sum of triangle_i with a copy of B scaled by r_i>0. We show that if the scaling factors r_1, ..., r_n are chosen randomly then the expected complexity of the union of C_1, ..., C_n is O(n^{2+epsilon), for any epsilon > 0; the constant of proportionality depends on epsilon and the complexity of B. The worst-case bound can be Theta(n^3).\nWe also consider a special case of this problem in which T is a set of points in R^3 and B is a unit cube in R^3, i.e., each C_i is a cube of side-length 2r_i. We show that if the scaling factors are chosen randomly then the expected complexity of the union of the cubes is O(n log^2 n), and it improves to O(n log n) if the scaling factors are chosen randomly from a \"well-behaved\" probability density function (pdf). We also extend the latter results to higher dimensions. For any fixed odd value of d, we show that the expected complexity of the union of the hypercubes is O(n^floor[d\/2] log n) and the bound improves to O(n^floor[d\/2]) if the scaling factors are chosen from a \"well-behaved\" pdf. The worst-case bounds are Theta(n^2) in R^3, and Theta(n^{ceil[d\/2]}) in higher dimensions.","keywords":["Computational geometry","Minkowski sums","Axis-parallel cubes","Union of geometric objects","Objects with random sizes"],"author":[{"@type":"Person","name":"Agarwal, Pankaj K.","givenName":"Pankaj K.","familyName":"Agarwal","affiliation":"Department of Computer Science, Duke University, Durham, NC 27708, USA","funding":"Work on this paper by Pankaj Agarwal and Micha Sharir has been supported by Grant 2012\/229 from the U.S.-Israel Binational Science Fund. Work by Pankaj Agarwal has also been supported by NSF under grants CCF-09-40671, CCF-10-12254, and CCF-11-61359, by ARO grants W911NF-07-1-0376 and W911NF-08-1-0452, and by an ERDC contract W9132V-11-C-0003."},{"@type":"Person","name":"Kaplan, Haim","givenName":"Haim","familyName":"Kaplan","affiliation":"School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Work by Haim Kaplan has been supported by grant 1841-14 from the Israel Science Fund, and grant 1367-2017 from the German-Israeli Science Fund."},{"@type":"Person","name":"Sharir, Micha","givenName":"Micha","familyName":"Sharir","affiliation":"School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Work by Micha Sharir has also been supported by Grant 892-13 from the Israel Science Fund, by the Blavatnik Research Fund in Computer Science at Tel Aviv University, and by the Hermann Minkowski - MINERVA Center for Geometry at Tel Aviv University."}],"position":10,"pageStart":"10:1","pageEnd":"10:15","dateCreated":"2018-07-04","datePublished":"2018-07-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Agarwal, Pankaj K.","givenName":"Pankaj K.","familyName":"Agarwal","affiliation":"Department of Computer Science, Duke University, Durham, NC 27708, USA","funding":"Work on this paper by Pankaj Agarwal and Micha Sharir has been supported by Grant 2012\/229 from the U.S.-Israel Binational Science Fund. Work by Pankaj Agarwal has also been supported by NSF under grants CCF-09-40671, CCF-10-12254, and CCF-11-61359, by ARO grants W911NF-07-1-0376 and W911NF-08-1-0452, and by an ERDC contract W9132V-11-C-0003."},{"@type":"Person","name":"Kaplan, Haim","givenName":"Haim","familyName":"Kaplan","affiliation":"School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Work by Haim Kaplan has been supported by grant 1841-14 from the Israel Science Fund, and grant 1367-2017 from the German-Israeli Science Fund."},{"@type":"Person","name":"Sharir, Micha","givenName":"Micha","familyName":"Sharir","affiliation":"School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","funding":"Work by Micha Sharir has also been supported by Grant 892-13 from the Israel Science Fund, by the Blavatnik Research Fund in Computer Science at Tel Aviv University, and by the Hermann Minkowski - MINERVA Center for Geometry at Tel Aviv University."}],"copyrightYear":"2018","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.10","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6310","volumeNumber":107,"name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","dateCreated":"2018-07-04","datePublished":"2018-07-04","editor":[{"@type":"Person","name":"Chatzigiannakis, Ioannis","givenName":"Ioannis","familyName":"Chatzigiannakis"},{"@type":"Person","name":"Kaklamanis, Christos","givenName":"Christos","familyName":"Kaklamanis"},{"@type":"Person","name":"Marx, D\u00e1niel","givenName":"D\u00e1niel","familyName":"Marx"},{"@type":"Person","name":"Sannella, Donald","givenName":"Donald","familyName":"Sannella"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article11020","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6310"}}}