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 Overmars and Yap , 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.
KeywordsMeasure Problem Segment Tree Spatial Data Structure Skeleton Tree Algebraic Computation Tree
Unable to display preview. Download preview PDF.
- 1.J.L. Bentley, Algorithms for Klee’s rectangle problem, Unpublished notes, Dept. of Computer Science, CMU, 1977.Google Scholar
- 4.S. S. Iyengar, N. S. V. Rao, R. L. Kashyap, and V. K. Vaishnavi, Multidimensional data structures: Review and outlook, Advances in Computers 27 1988 69–119.Google Scholar
- 7.F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag, 1985.Google Scholar
- 8.H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.Google Scholar