On the Klee’s Measure Problem in Small Dimensions
- Cite this paper as:
- Chlebus B.S. (1998) On the Klee’s Measure Problem in Small Dimensions. In: Rovan B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.