论文信息 - On the Klee's Measure Problem in Small Dimensions

On the Klee's Measure Problem in Small Dimensions

The Klee's measure problem is to compute the volume of the union of a given set of n isothetic boxes in a d-dimensional space. The fastest currently known algorithm for this problem, developed by Over-mars and Yap [6], runs in time O(nd/2 log n). We present an alternative simple approach with the same asymptotic performance. The exposition is restricted to dimensions three and four.

Bogdan S. Chlebus

[1] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[2] V. Klee. Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? , 1977 .

[3] Bruce W. Weide,et al. On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.

[4] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .

[5] Hanan Samet,et al. Hierarchical Spatial Data Structures , 1989, SSD.

[6] Mark H. Overmars,et al. New Upper Bounds in Klee's Measure Problem , 1991, SIAM J. Comput..

[7] S. Sitharama Iyengar,et al. Multidimensional Data Structures: Review and Outlook , 1988, Adv. Comput..

[8] Jan van Leeuwen,et al. The Measure Problem for Rectangular Ranges in d-Space , 1981, J. Algorithms.