A Discrete and Dynamic Version of Klee's Measure Problem
نویسندگان
چکیده
Given a set of axis-aligned boxes B = {B1, B2, . . . , Bn} and a set of points P = {p1, p2, . . . , pm} in d-space, let the discrete measure of B with respect to P be defined as meas(B,P) = |P ∩ { ⋃n i=1Bi}|, namely, the number of points of P contained in the union of boxes of B. This is a discrete and dynamic version of Klee’s measure problem, which asks for the Euclidean volume of a union of boxes. Our result is a data structure for maintaining meas(B,P) under dynamic updates to both P and B, with O(log n + m1− 1 d ) time for each insert or delete operation in B, O(log n + logm) time for each insert and O(logm) time for each delete operation in P, and O(1) time for the measure query. Our bound is slightly better than what can be achieved by applying a more general technique of Chan [3], but the primary appeal is that the method is simpler and more direct.
منابع مشابه
An Efficient Transformation for the Klee's Measure Problem in the Streaming Model
Given a stream of rectangles over a discrete space, we consider the problem of computing the total number of distinct points covered by the rectangles. This can be seen as the discrete version of the two-dimensional Klee’s measure problem for streaming inputs. We provide an ( , δ)-approximation for fat rectangles. For the case of arbitrary rectangles, we provide an O( √ logU)approximation, wher...
متن کاملA Streaming Approximation Algorithm for Klee's Measure Problem
The efficient estimation of frequency moments of a data stream in one-pass using limited space and time per item is one of the most fundamental problem in data stream processing. An especially important estimation is to find the number of distinct elements in a data stream, which is generally referred to as the zeroth frequency moment and denoted by F0. In this paper, we consider streams of rec...
متن کاملA Defined Benefit Pension Fund ALM Model through Multistage Stochastic Programming
We consider an asset-liability management (ALM) problem for a defined benefit pension fund (PF). The PF manager is assumed to follow a maximal fund valuation problem facing an extended set of risk factors: due to the longevity of the PF members, the inflation affecting salaries in real terms and future incomes, interest rates and market factors affecting jointly the PF liability and asset p...
متن کاملApplication of computational geometry to network p-center location problems
In this note we showed that a p(≥ 2)-center location problem in general networks can be transformed to the well known Klee’s measure problem [3]. This resulted in an improved algorithm for the continuous case with running time O(mn2 ∗ n log n). The previous best result for the problem is O(mnα(n) log n) where α(n) is the inverse Ackermann function [9]. When the underlying network is a partial k...
متن کامل