Suppose we have a set of n axis-aligned rectangular boxes in d-space, {B 1, B2,⋯, Bn }, where each box B i is active (or present) with an independent probability p i . We wish to compute the expected volume occupied by the union of all the active boxes. Our main result is a data structure for maintaining the expected volume over a dynamic family of such probabilistic boxes at an amortized cost of O(n(d-1)/2log n) time per insert or delete. The core problem turns out to be one-dimensional: we present a new data structure called an anonymous segment tree, which allows us to compute the expected length covered by a set of probabilistic segments in logarithmic time per update. Building on this foundation, we then generalize the problem to d dimensions by combining it with the ideas of Overmars and Yap [13]. Surprisingly, while the expected value of the volume can be efficiently maintained, we show that the tail bounds, or the probability distribution, of the volume are intractable-specifically, it is NP-hard to compute the probability that the volume of the union exceeds a given value V even when the dimension is d=1. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
YIldIz, H., Foschini, L., Hershberger, J., & Suri, S. (2011). The union of probabilistic boxes: Maintaining the volume. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 591–602). https://doi.org/10.1007/978-3-642-23719-5_50
Mendeley helps you to discover research relevant for your work.